The following pages link to Herbert Edelsbrunner (Q242843):
Displaying 11 items.
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Counting and cutting cycles of lines and rods in space (Q1194306) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Incremental topological flipping works for regular triangulations (Q1908263) (← links)
- Add isotropic Gaussian kernels at own risk (Q2874571) (← links)
- Ranking intervals under visibility constraints<sup>∗</sup> (Q3477956) (← links)
- On the shape of a set of points in the plane (Q3656974) (← links)
- Optimal Point Location in a Monotone Subdivision (Q3738618) (← links)
- Constructing Arrangements of Lines and Hyperplanes with Applications (Q3740283) (← links)
- An optimal algorithm for intersecting line segments in the plane (Q4302817) (← links)
