Pages that link to "Item:Q1093370"
From MaRDI portal
The following pages link to An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments (Q1093370):
Displaying 50 items.
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- Representation of segment Voronoi diagram by Bézier curves (Q300373) (← links)
- Witness Gabriel graphs (Q359756) (← links)
- Improved algorithms for the farthest colored Voronoi diagram of segments (Q391216) (← links)
- Bold graph drawings (Q654288) (← links)
- Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location (Q655203) (← links)
- An augmented Voronoi roadmap for 3D translational motion planning for a convex polyhedron moving amidst convex polyhedral obstacles (Q673760) (← links)
- Characterization of contour elements that generate abstract Voronoi diagrams (Q676068) (← links)
- A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
- Moving a disc between polygons (Q749237) (← links)
- Oracle complexities for computional geometry of semi-algebraic sets and voronoi diagrams (Q753493) (← links)
- Empty pseudo-triangles in point sets (Q765318) (← links)
- Farthest line segment Voronoi diagrams (Q845871) (← links)
- Fixed-radius near neighbors search algorithms for points and segments (Q916423) (← links)
- On maximum flows in polyhedral domains (Q918212) (← links)
- Divide-and-conquer for Voronoi diagrams revisited (Q991182) (← links)
- Low complexity algorithms for optimal consumer push-pull partial covering in the plane (Q1014939) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- Decomposing trimmed surfaces using the Voronoï diagram and a scan line algorithm (Q1126660) (← links)
- Degenerate point/curve and curve/curve bisectors arising in medial axis computations for planar domains with curved boundaries (Q1128909) (← links)
- An axiomatic approach to Voronoi-diagrams in 3D (Q1176108) (← links)
- Deferred data structure for the nearest neighbor problem (Q1183453) (← links)
- A convex hull algorithm for discs, and applications (Q1188286) (← links)
- Constructing the Voronoi diagram of a set of line segments in parallel (Q1206435) (← links)
- Duality of constrained Voronoi diagrams and Delaunay triangulations (Q1206436) (← links)
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- Locational optimization problems solved through Voronoi diagrams (Q1278720) (← links)
- A transfinite form of Sibson's interpolant (Q1289018) (← links)
- Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. II: Detailed algorithm description (Q1300769) (← links)
- Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. I: Theoretical foundations (Q1300788) (← links)
- Fast tree-based redistancing for level set computations (Q1302930) (← links)
- Semi-Lagrangian methods for level set equations (Q1306067) (← links)
- Tree methods for moving interfaces (Q1306073) (← links)
- The bisector of a point and a plane parametric curve (Q1324660) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Coordinated motion planning for two independent robots (Q1356168) (← links)
- On fast planning of suboptimal paths amidst polygonal obstacles in plane (Q1367531) (← links)
- On fat partitioning, fat covering and the union size of polygons (Q1384209) (← links)
- Rapid and accurate computation of the distance function using grids (Q1601551) (← links)
- 2-point site Voronoi diagrams (Q1613413) (← links)
- Disk packing for the estimation of the size of a wire bundle (Q1764345) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane (Q1907612) (← links)
- Voronoi-like partition of lattice in cellular automata (Q1914936) (← links)
- Hunting Voronoi vertices (Q1924717) (← links)
- Approximate matching of polygonal shapes (Q1924770) (← links)
- Deconstructing approximate offsets (Q1930550) (← links)
- On computing the convex hull of (piecewise) curved objects (Q1948676) (← links)
- Convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q2037112) (← links)
