The following pages link to Michael Hemmer (Q340540):
Displaying 17 items.
- Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354) (← links)
- Exact Minkowski sums of polygons with holes (Q1615780) (← links)
- Motion planning via manifold samples (Q2017878) (← links)
- Algorithms for art gallery illumination (Q2397430) (← links)
- Lines through Segments in 3D Space (Q2912865) (← links)
- Improved Implementation of Point Location in General Two-Dimensional Subdivisions (Q2912879) (← links)
- Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics (Q3527253) (← links)
- Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space (Q3586480) (← links)
- (Q4411357) (← links)
- Computing maxmin edge length triangulations (Q4626286) (← links)
- (Q5188243) (← links)
- Computing MaxMin Edge Length Triangulations (Q5232522) (← links)
- Computing a 3-dimensional cell in an arrangement of quadrics (Q5361588) (← links)
- An exact, complete and efficient implementation for computing planar maps of quadric intersection curves (Q5370601) (← links)
- A generic algebraic kernel for non-linear geometric applications (Q5404423) (← links)
- Algorithms – ESA 2005 (Q5475828) (← links)
