Pointed binary encompassing trees: simple and optimal (Q733553): Difference between revisions

@@ Property / Wikidata QID @@
+Q59782321
@@ Property / Wikidata QID: Q59782321 / 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.1016/j.comgeo.2006.12.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1972830235
@@ Property / OpenAlex ID: W1972830235 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulations without pointed spanning trees
@@ Property / cites work: Triangulations without pointed spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Every set of disjoint line segments admits a binary tree
+Normal rank
@@ Property / cites work @@
+Growing a Tree from Its Branches
@@ Property / cites work: Growing a Tree from Its Branches / rank @@
+Normal rank
@@ Property / cites work @@
+Ray shooting in polygons using geodesic triangulations
+Normal rank
@@ Property / cites work @@
+Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
+Normal rank
@@ Property / cites work @@
+Pointed and colored binary encompassing trees
@@ Property / cites work: Pointed and colored binary encompassing trees / rank @@
+Normal rank
@@ Property / cites work @@
+Segment endpoint visibility graphs are Hamiltonian
+Normal rank
@@ Property / cites work @@
+Encompassing colored planar straight line graphs
@@ Property / cites work: Encompassing colored planar straight line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tight degree bounds for pseudo-triangulations of points
+Normal rank
@@ Property / cites work @@
+Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
+Normal rank
@@ Property / cites work @@
+Generalized Delaunay triangulation for planar graphs
+Normal rank
@@ Property / cites work @@
+Minimal tangent visibility graphs
@@ Property / cites work: Minimal tangent visibility graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Topologically sweeping visibility complexes via pseudotriangulations
+Normal rank
@@ Property / cites work @@
+Computing Simple Circuits from a Set of Line Segments is NP-Complete
+Normal rank
@@ Property / cites work @@
+Computing simple circuits from a set of line segments
+Normal rank
@@ Property / cites work @@
+A vertex-face assignment for plane graphs
@@ Property / cites work: A vertex-face assignment for plane graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
+Normal rank
@@ Property / cites work @@
+Acute triangulations of polygons
@@ Property / cites work: Acute triangulations of polygons / rank @@
+Normal rank