Pages that link to "Item:Q1185003"
From MaRDI portal
The following pages link to Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003):
Displaying 35 items.
- Shortcut sets for plane Euclidean networks (extended abstract) (Q510569) (← links)
- Design and analysis of planar shape deformation (Q699976) (← links)
- Efficient on-line algorithms for Euler diagram region computation (Q709068) (← links)
- Model-based segmentation and classification of trajectories (Q724245) (← links)
- Stability versus speed in a computable algebraic model (Q817853) (← links)
- Between shapes, using the Hausdorff distance (Q824335) (← links)
- Convex blocking and partial orders on the plane (Q902426) (← links)
- Finding the \(\Theta \)-guarded region (Q1037785) (← links)
- Searching for equilibrium positions in a game of political competition with restrictions (Q1038350) (← links)
- Facility location problems in the plane based on reverse nearest neighbor queries (Q1038383) (← links)
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- Castles in the air revisited (Q1334929) (← links)
- Three-dimensional weak visibility: Complexity and applications (Q1575678) (← links)
- A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane (Q1744887) (← links)
- Robot motion planning and the single cell problem in arrangements (Q1842755) (← links)
- Almost tight upper bounds for the single cell and zone problems in the three dimensions (Q1906044) (← links)
- Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment (Q1984612) (← links)
- Embeddability of arrangements of pseudocircles and graphs on surfaces (Q2197691) (← links)
- Shortcut sets for the locus of plane Euclidean networks (Q2335528) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
- Selecting distances in the plane (Q2366232) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- The optimal tenement allocation for reducing traffic burden (Q2630839) (← links)
- COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET (Q4513242) (← links)
- AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE (Q4661880) (← links)
- THREE-DIMENSIONAL TOPOLOGICAL SWEEP FOR COMPUTING ROTATIONAL SWEPT VOLUMES OF POLYHEDRAL OBJECTS (Q4682193) (← links)
- ON COMPUTING TRANSLATIONAL SWEPT VOLUMES (Q4949993) (← links)
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications (Q5057426) (← links)
- Robust mean absolute deviation problems on networks with linear vertex weights (Q5326780) (← links)
- On the zone of a circle in an arrangement of lines (Q5890903) (← links)
- On the zone of a circle in an arrangement of lines (Q5892415) (← links)
- Balanced line separators of unit disk graphs (Q5918796) (← links)
- Polygonal chains cannot lock in 4D (Q5952584) (← links)
- Three dimensional weak visibility: Complexity and applications (Q6064014) (← links)