Triangulating input-constrained planar point sets (Q975526): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2008.09.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2065568351
@@ Property / OpenAlex ID: W2065568351 / rank @@
+Normal rank
@@ Property / cites work @@
+Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
+Normal rank
@@ Property / cites work @@
+Largest and Smallest Tours and Convex Hulls for Imprecise Points
+Normal rank
@@ Property / cites work @@
+Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
+Normal rank
@@ Property / cites work @@
+On-line construction of the convex hull of a simple polyline
+Normal rank
@@ Property / cites work @@
+Triangulating Simple Polygons and Equivalent Problems
+Normal rank