Pages that link to "Item:Q3128986"
From MaRDI portal
The following pages link to Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations (Q3128986):
Displayed 13 items.
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- Pointed binary encompassing trees: simple and optimal (Q733553) (← links)
- Decomposing a simple polygon into pseudo-triangles and convex polygons (Q934018) (← links)
- Highway hull revisited (Q1037778) (← links)
- Tight degree bounds for pseudo-triangulations of points (Q1873151) (← links)
- An algorithmic study of manufacturing paperclips and other folded structures. (Q1873158) (← links)
- Minimum weight pseudo-triangulations (Q2385693) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)
- FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS (Q4818559) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)