Triangulating input-constrained planar point sets

Information Processing Letters

Volumn 109, Issue 1, 2008, Pages 54-56

  Held, Martin ^a   Mitchell, Joseph S B ^b  

^a UNIVERSITY OF SALZBURG   (Austria)

^b STONY BROOK UNIVERSITY   (United States)

Author keywords

Computational geometry; Constrained; Imprecision; Points; Triangulation

Indexed keywords

ASPECT RATIO; CLUSTERING ALGORITHMS; COMPUTATIONAL GEOMETRY; DISKS (MACHINE COMPONENTS); DISKS (STRUCTURAL COMPONENTS); GEODESY; SET THEORY; TRIANGULATION;

CONSTRAINED; CONVEX SETS; IMPRECISION; PLANAR POINT SETS; POINTS; PRE-PROCESSING; QUERY POINTS; TIME ALGORITHMS; UNIFORM SIZES;

TREES (MATHEMATICS);

EID: 55149087469     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.09.016     Document Type: Article

References (5)

1. Bandyopadhyay D., and Snoeyink J. Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL. Comput. Geom. Theory Appl. 38 1-2 (2007) 4-15
2. Löffler M., and van Kreveld M. Largest and smallest tours and convex hulls for imprecise points. Proc. Scand. Workshop Algorithm Theory '06 (2006) 375-387
3. Löffler M., and van Kreveld M. Largest bounding box, smallest diameter, and related problems on imprecise points. Proc. Workshop Algorithms Data Struct. '07 (2007) 446-457
4. Melkman A. On-line construction of the convex hull of a simple polyline. Inform. Process. Lett. 25 (1987) 11-12
5. Fournier A., and Montuno D. Triangulating simple polygons and equivalent problems. ACM Trans. Graph. 3 2 (1984) 153-174