Near optimal line segment queries in simple polygons (Q891822): Difference between revisions

@@ Property / cites work @@
+Visibility queries and maintenance in simple polygons
+Normal rank
@@ Property / cites work @@
+Efficient visibility queries in simple polygons
@@ Property / cites work: Efficient visibility queries in simple polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulating a simple polygon in linear time
@@ Property / cites work: Triangulating a simple polygon in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Visibility and intersection problems in plane geometry
+Normal rank
@@ Property / cites work @@
+Weak visibility queries of line segments in simple polygons
+Normal rank
@@ Property / cites work @@
+Visibility Algorithms in the Plane
@@ Property / cites work: Visibility Algorithms in the Plane / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+Optimal Search in Planar Subdivisions
@@ Property / cites work: Optimal Search in Planar Subdivisions / rank @@
+Normal rank
@@ Property / cites work @@
+Weak visibility queries of line segments in simple polygons and polygonal domains
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
+Normal rank