Algorithms for Reporting and Counting Geometric Intersections

Cited in

(only showing first 100 items - show all)

Topological sweep of the complete graph
Finding the \(\Theta \)-guarded region
Searching for equilibrium positions in a game of political competition with restrictions
Facility location problems in the plane based on reverse nearest neighbor queries
A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form
On a circle placement problem
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Computing convolutions by reciprocal search
A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
The expected size of some graphs in computational geometry
Scanline algorithms on a grid
Space reduction and an extension for a hidden line elimination algorithm
Space and time optimal algorithms for a class of rectangle intersection problems
A recursive sweep-plane algorithm, determining all cells of a finite division of R^ m.
Polygonal intersection searching
A tight upper bound for the number of intersections between two rectangulars paths
Line-segment intersection reporting in parallel
The furthest-site geodesic Voronoi diagram
The upper envelope of Voronoi surfaces and its applications
Efficient hidden surface removal for objects with small union size
On the general motion-planning problem with two degrees of freedom
Testing the necklace condition for shortest tours and optimal factors in the plane
Implicitly representing arrangements of lines or segments
Checking the convexity of polytopes and the planarity of subdivisions
Abstract sphere-of-influence graphs
Visibility with a moving point of view
The pin redistribution problem in multi-chip modules
Monte Carlo approximation of form factors with error bounded a priori
On fat partitioning, fat covering and the union size of polygons
Visibility with multiple diffuse reflections
Algebraic properties of location problems with one circular barrier.
Space-time trade-offs for some ranking and searching queries
Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
Finding exact solutions for the geometric firefighter problem in practice
Mutual exclusion in MANETs using quorum agreements
New algorithm to find isoptic surfaces of polyhedral meshes
A greedy heuristic for crossing-angle maximization
The geometry of carpentry and joinery
Constructing arrangements optimally in parallel
Reporting and counting segment intersections
A unifying approach for a class of problems in the computational geometry of polygons
Extraction of embedded and/or line-touching character-like objects
Reporting intersecting pairs of convex polytopes in two and three dimensions
Efficient visibility queries in simple polygons
Translating a regular grid over a point set
Separability by two lines and by nearly straight polygonal chains
Vertical decompositions for triangles in 3-space
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
Computing the Fréchet gap distance
Intersections and circuits in sets of line segments
On the fast delivery problem with one or two packages
Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
Sigma-local graphs
Computing the visibility map of fat objects
Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
On constant factors in comparison-based geometric algorithms and data structures
Selecting distances in the plane
Computing the intersection-depth to polyhedra
Algorithms for projecting points to give the most uniform distribution with applications to hashing
Advanced programming techniques applied to CGAL's arrangement package
Line-segment intersection made in-place
Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
Testing graph isotopy on surfaces
Query point visibility computation in polygons with holes
Improved output-sensitive snap rounding
Exact, efficient, and complete arrangement computation for cubic curves
Visible region extraction from a sequence of rational Bézier surfaces
Counting and representing intersections among triangles in three dimensions
An exact and efficient approach for computing a cell in an arrangement of quadrics
A fast planar partition algorithm. I
Linear time computation of feasible regions for robust compensators
Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
Approximability issues of guarding a set of segments
TOPOLOGY-PRESERVING WATERMARKING OF VECTOR GRAPHICS
Geometric type-2 fuzzy sets
Computing largest empty circles with location constraints
Continuous-time moving network Voronoi diagram
Networked control challenges in collaborative road freight transport
An optimal time and minimal space algorithm for rectangle intersection problems
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
A worst-case efficient algorithm for hidden-line elimination^†
Divide-and-conquer in planar geometry
Reporting Intersections of Polygons
Euclidean chains and their shortcuts
Robustness in the Pareto-solutions for the multi-criteria minisum location problem
Efficient algorithms for local ranking
Rounding Arrangements Dynamically
Relative convex hulls in semi-dynamic arrangements
COMPUTING CLOSEST POINTS FOR SEGMENTS
COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
Rectilinear convex hull with minimum area
scientific article; zbMATH DE number 1417899 (Why is no real title available?)
Visibility with multiple reflections
An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
Star unfolding of a polytope with applications
A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects
Counting and reporting red/blue segment intersections
Repetitive hidden-surface-removal for polyhedral scenes
Smoothing the Gap Between NP and ER
scientific article; zbMATH DE number 7525513 (Why is no real title available?)

This page was built for publication: Algorithms for Reporting and Counting Geometric Intersections

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