Pages that link to "Item:Q1084674"
From MaRDI portal
The following pages link to Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams (Q1084674):
Displaying 37 items.
- An augmented Voronoi roadmap for 3D translational motion planning for a convex polyhedron moving amidst convex polyhedral obstacles (Q673760) (← links)
- A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
- On the construction of abstract Voronoi diagrams (Q757052) (← links)
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions (Q908209) (← links)
- Stable Delaunay graphs (Q908210) (← links)
- The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments (Q1093370) (← links)
- A sweepline algorithm for Voronoi diagrams (Q1101224) (← links)
- A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space (Q1102109) (← links)
- Separating two simple polygons by a sequence of translations (Q1104080) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures (Q1201745) (← links)
- On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
- Penny-packing and two-dimensional codes (Q1262539) (← links)
- An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space (Q1263972) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Extremal polygon containment problems (Q1330463) (← links)
- On-line motion planning: Case of a planar rod (Q1356165) (← links)
- Construction of optimal programmed paths for the motion of a robotic manipulator (Q1375265) (← links)
- On the computation of zone and double zone diagrams (Q1704894) (← links)
- On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space (Q1821354) (← 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)
- Deconstructing approximate offsets (Q1930550) (← links)
- Stability of solutions in problems of computational geometry (Q1974331) (← links)
- Convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q2037112) (← links)
- Voronoi diagrams over dynamic scenes (Q2367408) (← links)
- The geometry of Minkowski spaces -- a survey. II. (Q2571082) (← links)
- Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function (Q2971631) (← links)
- DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION (Q3401890) (← links)
- AN ALGEBRA FOR SLOPE-MONOTONE CLOSED CURVES (Q4223755) (← links)
- Approximating Voronoi Diagrams of Convex Sites in Any Dimension (Q4513208) (← links)
- Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
- (Q5743404) (← links)
- Polygon decomposition for efficient construction of Minkowski sums (Q5959553) (← links)
