Pages that link to "Item:Q4513200"
From MaRDI portal
The following pages link to An Output-Sensitive Convex Hull Algorithm for Planar Objects (Q4513200):
Displaying 16 items.
- Improved algorithms for the farthest colored Voronoi diagram of segments (Q391216) (← links)
- Planar lower envelope of monotone polygonal chains (Q495682) (← links)
- Output-sensitive peeling of convex and maximal layers (Q671619) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- An efficient convex hull algorithm using affine transformation in planar point set (Q900582) (← links)
- An algorithmic toolbox for network calculus (Q1020549) (← links)
- An output sensitive algorithm for discrete convex hulls (Q1388138) (← links)
- Synergistic solutions for merging and computing planar convex hulls (Q1790964) (← links)
- Convex hulls of spheres and convex hulls of disjoint convex polytopes (Q1947973) (← links)
- On computing the convex hull of (piecewise) curved objects (Q1948676) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- An exact and efficient approach for computing a cell in an arrangement of quadrics (Q2575587) (← links)
- Another Classroom Example of Robustness Problems in Planar Convex Hull Computation (Q2807866) (← links)
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm (Q4366880) (← links)
- Dynamic data structures for fat objects and their applications (Q5096947) (← links)
- LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS (Q5300001) (← links)
