Algorithms for Reporting and Counting Geometric Intersections

Cited in

(only showing first 100 items - show all)

Euclidean chains and their shortcuts
Visibility with multiple reflections
The furthest-site geodesic Voronoi diagram
An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
On the fast delivery problem with one or two packages
A subdivision method for arrangement computation of semi-algebraic curves
Efficient visibility queries in simple polygons
An algebraic algorithm to compute the exact general sweep boundary of a 2D curved object
A greedy heuristic for crossing-angle maximization
The unpredictable deviousness of models
Capturing crossings: convex hulls of segment and plane intersections
COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
Algorithms for the line-constrained disk coverage and related problems
Algorithms for the line-constrained disk coverage and related problems
Extraction of embedded and/or line-touching character-like objects
Space reduction and an extension for a hidden line elimination algorithm
Space-time trade-offs for some ranking and searching queries
Facility location problems in the plane based on reverse nearest neighbor queries
The expected size of some graphs in computational geometry
GUARDING ART GALLERIES BY GUARDING WITNESSES
Algorithms for marketing-mix optimization
Reporting and counting segment intersections
Constructing arrangements optimally in parallel
Polygonal intersection searching
An exact and efficient approach for computing a cell in an arrangement of quadrics
Robustness in the Pareto-solutions for the multi-criteria minisum location problem
A fast planar partition algorithm. I
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Energetic reasoning and mixed-integer linear programming for scheduling with a continuous resource and linear efficiency functions
Query point visibility computation in polygons with holes
A series of algorithmic results related to the iterated hairpin completion
Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space
Exact, efficient, and complete arrangement computation for cubic curves
On counting pairs of intersecting segments and off-line triangle range searching
Finding exact solutions for the geometric firefighter problem in practice
Topology and arrangement computation of semi-algebraic planar curves
Boolean algebra of two-dimensional continua with arbitrarily complex topology
Improved output-sensitive snap rounding
On a circle placement problem
Separability by two lines and by nearly straight polygonal chains
Guarding a set of line segments in the plane
Algorithms for projecting points to give the most uniform distribution with applications to hashing
Efficient algorithms for local ranking
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
Vertical decompositions for triangles in 3-space
On constant factors in comparison-based geometric algorithms and data structures
Optimal algorithms for some polygon enclosure problems for VLSI layout analysis
Computing simple circuits from a set of line segments
Repetitive hidden-surface-removal for polyhedral scenes
A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
Reporting Intersections of Polygons
Translating a regular grid over a point set
TOPOLOGY-PRESERVING WATERMARKING OF VECTOR GRAPHICS
Implicitly representing arrangements of lines or segments
The complexity and construction of many faces in arrangements of lines and of segments
Visible region extraction from a sequence of rational Bézier surfaces
A unifying approach for a class of problems in the computational geometry of polygons
scientific article; zbMATH DE number 7662166 (Why is no real title available?)
The geometry of carpentry and joinery
The upper envelope of Voronoi surfaces and its applications
Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
2-opt moves and flips for area-optimal polygonizations
Selecting distances in the plane
Space and time optimal algorithms for a class of rectangle intersection problems
New algorithm to find isoptic surfaces of polyhedral meshes
Scanline algorithms on a grid
scientific article; zbMATH DE number 7559246 (Why is no real title available?)
Computing the arrangement of circles on a sphere, with applications in structural biology
On the general motion-planning problem with two degrees of freedom
Star unfolding of a polytope with applications
Approximability issues of guarding a set of segments
Networked control challenges in collaborative road freight transport
Computing convolutions by reciprocal search
Sigma-local graphs
Computing the visibility map of fat objects
An effective similarity measurement under epistemic uncertainty
Reporting intersecting pairs of convex polytopes in two and three dimensions
Efficient hidden surface removal for objects with small union size
Testing the necklace condition for shortest tours and optimal factors in the plane
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
Visibility with a moving point of view
Line-segment intersection made in-place
A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces
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
Multi-facility ordered median problems in directed networks
Visibility with multiple diffuse reflections
Counting and reporting red/blue segment intersections
An optimal time and minimal space algorithm for rectangle intersection problems
On fat partitioning, fat covering and the union size of polygons
Testing graph isotopy on surfaces
Relative convex hulls in semi-dynamic arrangements
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
Finding the \(\Theta \)-guarded region
A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects
Convex blocking and partial orders on the plane
A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form
The pin redistribution problem in multi-chip modules
scientific article; zbMATH DE number 1417899 (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)