Pages that link to "Item:Q2638830"
From MaRDI portal
The following pages link to A fast planar partition algorithm. I (Q2638830):
Displaying 16 items.
- Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
- Farthest-polygon Voronoi diagrams (Q632728) (← links)
- On the union of fat wedges and separating a collection of segments by a line (Q1314526) (← links)
- Untangling planar curves (Q1688858) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- On-line construction of the upper envelope of triangles and surface patches in three dimensions (Q1917040) (← links)
- Average case analysis of dynamic geometric optimization (Q1917043) (← links)
- A binomial sum of harmonic numbers (Q2092321) (← links)
- Advanced programming techniques applied to CGAL's arrangement package (Q2371336) (← links)
- FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT (Q2875646) (← links)
- Rounding Arrangements Dynamically (Q4513207) (← links)
- Towards an Optimal Method for Dynamic Planar Point Location (Q4562277) (← links)
- Adaptive Point Location in Planar Convex Subdivisions (Q5370568) (← links)
- GUARDING ART GALLERIES BY GUARDING WITNESSES (Q5470173) (← links)
- Markov incremental constructions (Q5896960) (← links)
- Partial order multiway search (Q6535268) (← links)
