Pages that link to "Item:Q3953198"

The following pages link to Plane-sweep algorithms for intersecting geometric figures (Q3953198):

Displaying 38 items.

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