Plane-sweep algorithms for intersecting geometric figures

Cited in

(38)

Reconstructing visible regions from visible segments
Time-and space-optimal contour computation for a set of rectangles
Reporting and counting segment intersections
Obstacle growing in a nonpolygonal world
Polygonal intersection searching
TOPOLOGICAL PEELING AND APPLICATIONS
A general method for decomposing self-intersecting polygon to normal based on self-intersection points
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
On counting pairs of intersecting segments and off-line triangle range searching
Reporting Intersections of Polygons
A unifying approach for a class of problems in the computational geometry of polygons
Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
Efficient optimally lazy algorithms for minimal-interval semantics
Fixed-radius near neighbors search algorithms for points and segments
How to draw a planarization
Topologically sweeping an arrangement
Partitioning and separating sets of orthogonal polygons
\(\alpha\)-kernel problem with fuzzy visibility
Computing convolutions by reciprocal search
A geometric approach to error detection recovery for robot motion planning with uncertainty
Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution
An improved upper bound on the number of intersections between two rectangular paths
Space sweep solves intersection of convex polyhedra
A sweep-line algorithm for the inclusion hierarchy among circles
A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form
How to draw a planarization
A recursive sweep-plane algorithm, determining all cells of a finite division of R^ m.
A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form
A worst-case efficient algorithm for hidden-line elimination^†
A tight upper bound for the number of intersections between two rectangulars paths
Topological sweep of the complete graph
Polygonizations of point sets in the plane
Linear time computation of feasible regions for robust compensators
On some union and intersection problems for polygons with fixed orientations
On multiple moving objects
The one-dimensional weighted Voronoi diagram
Reassembling polygons from edges
An efficient algorithm for one-step planar compliant motion planning with uncertainty

This page was built for publication: Plane-sweep algorithms for intersecting geometric figures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3953198)