ISSN:
1432-2315
Keywords:
Key words: Triangulations
;
Hamiltonian paths
;
Quadrangulation
;
Rendering
;
Computer graphics
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
any set of n points in the plane has a Hamiltonian triangulation; (2) prove that certain nondegenerate point sets do not admit a sequential triangulation; (3) test whether a polygon P has a Hamiltonian triangulation in time linear in the size of its visibility graph; and (4) show how to add Steiner points to a triangulation to create Hamiltonian triangulations that avoid narrow angles.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01782475
Permalink