Pages that link to "Item:Q1188286"
From MaRDI portal
The following pages link to A convex hull algorithm for discs, and applications (Q1188286):
Displaying 18 items.
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas (Q672261) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- Maximal and minimal balls (Q1314525) (← links)
- The visibility graph of congruent discs is Hamiltonian (Q1873692) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- An algorithm for constructing the convex hull of a set of spheres in dimension \(d\) (Q1917048) (← 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)
- Near optimal minimal convex hulls of disks (Q2046265) (← links)
- A dynamic sampling approach towards computing Voronoi diagram of a set of circles (Q2243180) (← links)
- Largest bounding box, smallest diameter, and related problems on imprecise points (Q2269143) (← links)
- QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
- Packing circles into perimeter-minimizing convex hulls (Q2423783) (← links)
- An Output-Sensitive Convex Hull Algorithm for Planar Objects (Q4513200) (← links)
- Finding the Convex Hull of Discs in Parallel (Q4513213) (← links)
- Linear approximation of simple objects (Q5906528) (← links)
- Separating objects in the plane by wedges and strips (Q5929324) (← links)
- A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines (Q6618153) (← links)
