Pages that link to "Item:Q3049855"
From MaRDI portal
The following pages link to Algorithms for Reporting and Counting Geometric Intersections (Q3049855):
Displayed 50 items.
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- Efficient hidden surface removal for objects with small union size (Q1208434) (← links)
- On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (Q1276945) (← links)
- Abstract sphere-of-influence graphs (Q1310234) (← links)
- Visibility with a moving point of view (Q1322569) (← links)
- The pin redistribution problem in multi-chip modules (Q1327562) (← links)
- Monte Carlo approximation of form factors with error bounded a priori (Q1355196) (← links)
- On fat partitioning, fat covering and the union size of polygons (Q1384209) (← links)
- Visibility with multiple diffuse reflections (Q1392849) (← links)
- Algebraic properties of location problems with one circular barrier. (Q1420408) (← links)
- Space-time trade-offs for some ranking and searching queries (Q1603491) (← links)
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions (Q1622795) (← links)
- Finding exact solutions for the geometric firefighter problem in practice (Q1652708) (← links)
- Mutual exclusion in MANETs using quorum agreements (Q1700590) (← links)
- New algorithm to find isoptic surfaces of polyhedral meshes (Q1711799) (← links)
- A greedy heuristic for crossing-angle maximization (Q1725762) (← links)
- The geometry of carpentry and joinery (Q1765245) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Reporting and counting segment intersections (Q1821557) (← links)
- A unifying approach for a class of problems in the computational geometry of polygons (Q1822499) (← links)
- Extraction of embedded and/or line-touching character-like objects (Q1860226) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- Efficient visibility queries in simple polygons (Q1862134) (← links)
- Translating a regular grid over a point set (Q1873153) (← links)
- Separability by two lines and by nearly straight polygonal chains (Q1885815) (← links)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations (Q2022326) (← links)
- Computing the Fréchet gap distance (Q2022625) (← links)
- Intersections and circuits in sets of line segments (Q2084612) (← links)
- On the fast delivery problem with one or two packages (Q2208259) (← links)
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments (Q2248734) (← links)
- Sigma-local graphs (Q2266933) (← links)
- Computing the visibility map of fat objects (Q2269142) (← links)
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances (Q2301150) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- Selecting distances in the plane (Q2366232) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- Algorithms for projecting points to give the most uniform distribution with applications to hashing (Q2366237) (← links)
- Advanced programming techniques applied to CGAL's arrangement package (Q2371336) (← links)
- Line-segment intersection made in-place (Q2385700) (← links)
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions (Q2423818) (← links)
- Testing graph isotopy on surfaces (Q2441582) (← links)
- Query point visibility computation in polygons with holes (Q2462733) (← links)
- Improved output-sensitive snap rounding (Q2482192) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- Visible region extraction from a sequence of rational Bézier surfaces (Q2508282) (← links)