Cartographic line simplication and polygon CSG formulae in O(n log* n) time (Q5096928): Difference between revisions

@@ Property / author @@
+J. E. Hershberger
@@ Property / author: J. E. Hershberger / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-63307-3_50
+Normal rank
@@ Property / OpenAlex ID @@
+W53622112
@@ Property / OpenAlex ID: W53622112 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for finding the CSG representation of a simple polygon
+Normal rank
@@ Property / cites work @@
+COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+Sorting jordan sequences in linear time using level-linked search trees
+Normal rank
@@ Property / cites work @@
+On-line construction of the convex hull of a simple polyline
+Normal rank
@@ Property / cites work @@
+Maintenance of configurations in the plane
@@ Property / cites work: Maintenance of configurations in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank