Advertisement

Journal of Computer Science and Technology

, Volume 5, Issue 4, pp 329–332 | Cite as

Discrete interpolation surface

  • Xu Zhiming 
Regular Papers
  • 15 Downloads

Abstract

In this paper, a method to construct a surface with point interpolation and normal interpolation is presented. An algorithm to construct the discrete interpolation is also presented, which has the time complexityO (Nlog N), whereN in the number of scattered points.

Keywords

Voronoi Diagram Topological Relation Span Tree Problem Scattered Point Discrete Surface 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E. Catmull and J. Clark, Recursively generatingB-spline surface on arbitrary topological meshes,CAD,10: 6 (1978).Google Scholar
  2. [2]
    D. Doo and M. Sabin. Behaviour of recursively division surface near extraordinary points,CAD 10: 6 (1978).Google Scholar
  3. [3]
    F. P. Preparata and M. I. Shamos, Computational Geometry, Spring-Verlag, 1985.Google Scholar
  4. [4]
    D. T. Leeet al. Computational geometry — A surveyIEEE Trans. Computers. C-33(1985).Google Scholar
  5. [5]
    G. Toussaint. Computational Geometry, North-Holland, 1985.Google Scholar
  6. [6]
    Lu Wei, Jin Tongguang and Liang Youdong, Surfaces generated by cutting and grinding polyhedra with arbitrary topological meshes —C-G surfaces, Proc. of CADDM, 1987, Beijing.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1990

Authors and Affiliations

  • Xu Zhiming 
    • 1
  1. 1.CAD Laboratory, Institute of Computing TechnologyAcademia SinicaBeijingChina

Personalised recommendations