Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
IEEE Transactions on Computers
Computing a sweeping-plane in regular (“general”) position: a numerical and a symbolic solution
Journal of Symbolic Computation
A fast planar partition algorithm, I
Journal of Symbolic Computation
Hidden surface removal with respect to a moving view point
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Visibility with a moving point of view
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Structure Theorems for Systems of Segments
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
On the Complexity of the Union of Geometric Objects
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Intersecting Red and Blue Line Segments in Optimal Time and Precision
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Toward Spatial Joins for Polygons
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Advanced programming techniques applied to Cgal's arrangement package
Computational Geometry: Theory and Applications
Dynamic planar map illustration
ACM SIGGRAPH 2007 papers
Line-segment intersection made in-place
Computational Geometry: Theory and Applications
Query point visibility computation in polygons with holes
Computational Geometry: Theory and Applications
IEEE Transactions on Computers
Spatial Planning: A Configuration Space Approach
IEEE Transactions on Computers
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
IEEE Transactions on Computers
Computational Geometry on a Systolic Chip
IEEE Transactions on Computers
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
IEEE Transactions on Computers
Exact and efficient 2D-arrangements of arbitrary algebraic curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Exact arrangements on tori and Dupin cyclides
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms (TALG)
Capturing crossings: Convex hulls of segment and plane intersections
Information Processing Letters
Detection of spatial conflicts between rivers and contours in digital map updating
International Journal of Geographical Information Science
Relative Convex Hulls in Semi-dynamic Subdivisions
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Topology and arrangement computation of semi-algebraic planar curves
Computer Aided Geometric Design
The unpredictable deviousness of models
Theoretical Computer Science
Topological sweep of the complete graph
Discrete Applied Mathematics
Empirical evaluation of clone detection using syntax suffix trees
Empirical Software Engineering
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere
Computational Geometry: Theory and Applications
Computing the arrangement of circles on a sphere, with applications in structural biology
Computational Geometry: Theory and Applications
Tool-path generation for sidewall machining
Computers and Industrial Engineering
Determining directional distances between points and shorelines using sweep line technique
International Journal of Geographical Information Science
Computer Aided Geometric Design
Visibility-based modelling and control for network-based robotics
Pattern Recognition Letters
Region Extraction and Verification for Spatial and Spatio-temporal Databases
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Planar rectilinear shortest path computation using corridors
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
A meeting scheduling problem respecting time and space
Geoinformatica
Lattice-based minimum error rate training for statistical machine translation
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Exact, efficient, and complete arrangement computation for cubic curves
Computational Geometry: Theory and Applications
Counting and representing intersections among triangles in three dimensions
Computational Geometry: Theory and Applications
Journal of Discrete Algorithms
Tool path generation for a surface model with defects
Computers in Industry
Technical Section: Collision detection using polar diagrams
Computers and Graphics
A parallel plane sweep algorithm for multi-core systems
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Computing the visibility map of fat objects
Computational Geometry: Theory and Applications
Separability by two lines and by nearly straight polygonal chains
Discrete Applied Mathematics
A fast and accurate algorithm for the quantification of peptides from mass spectrometry data
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Applying spatial reasoning to topographical data with a grounded geographical ontology
GeoS'07 Proceedings of the 2nd international conference on GeoSpatial semantics
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Sweeping and maintaining two-dimensional arrangements on surfaces: a first step
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Ensuring the semantic correctness of complex regions
ER'07 Proceedings of the 2007 conference on Advances in conceptual modeling: foundations and applications
Guaranteeing safety in spatially situated agents
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Industrial strength polygon clipping: A novel algorithm with applications in VLSI CAD
Computer-Aided Design
A series of algorithmic results related to the iterated hairpin completion
Theoretical Computer Science
Efficient k-nearest neighbor search on moving object trajectories
The VLDB Journal — The International Journal on Very Large Data Bases
Detecting areas visited regularly
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Finding Rectangle Intersections by Divide-and-Conquer
IEEE Transactions on Computers
Journal of Symbolic Computation
Guarding a set of line segments in the plane
Theoretical Computer Science
Search algorithm to find optimum strategies to shape political action with subjective assessment
ECS'10/ECCTD'10/ECCOM'10/ECCS'10 Proceedings of the European conference of systems, and European conference of circuits technology and devices, and European conference of communications, and European conference on Computer science
Spatial Modelling for Mobile Robot's Vision-based Navigation
Journal of Intelligent and Robotic Systems
Proceedings of the twenty-seventh annual symposium on Computational geometry
Euclidean chains and their shortcuts
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Convex partitions with 2-edge connected dual graphs
Journal of Combinatorial Optimization
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Geospatial overlay computation on the GPU
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Algorithms for vector graphic optimization and compression
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
EXACUS: efficient and exact algorithms for curves and surfaces
ESA'05 Proceedings of the 13th annual European conference on Algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Overlaying multiple maps efficiently
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Line-segment intersection made in-place
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Guarding art galleries by guarding witnesses
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Continuous-time moving network voronoi diagram
Transactions on Computational Science XIV
Tight bound for farthest-color voronoi diagrams of line segments
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
A content-based publish/subscribe matching algorithm for 2d spatial objects
Middleware'11 Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware
Efficient algorithms for local ranking
Information Processing Letters
Testing graph isotopies on surfaces
Proceedings of the twenty-eighth annual symposium on Computational geometry
Abstract sphere-of-influence graphs
Mathematical and Computer Modelling: An International Journal
Elastic computing: A portable optimization framework for hybrid computers
Parallel Computing
Normal art galleries: Wall in - all in
Computational Geometry: Theory and Applications
Non-crossing matchings of points with geometric objects
Computational Geometry: Theory and Applications
Parallel version of image segmentation algorithm using polygonal markov fields
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Assessing the vulnerability of the fiber infrastructure to disasters
IEEE/ACM Transactions on Networking (TON)
The RACECAR heuristic for automatic function specialization on multi-core heterogeneous systems
Proceedings of the 2012 international conference on Compilers, architectures and synthesis for embedded systems
Polyhedral visual hulls for real-time rendering
EGWR'01 Proceedings of the 12th Eurographics conference on Rendering
Computing the visibility map of fat objects
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A unified method for invalid 2D loop removal in tool-path generation
Computer-Aided Design
Loyalty-based selection: retrieving objects that persistently satisfy criteria
Proceedings of the 21st ACM international conference on Information and knowledge management
Fast vertex guarding for polygons with and without holes
Computational Geometry: Theory and Applications
Sweeping in Abstract Interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
A content-based publish/subscribe matching algorithm for 2D spatial objects
Proceedings of the 12th International Middleware Conference
New algorithms for computer graphics
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
Computational Geometry: Theory and Applications
Computational Intelligence and Neuroscience
Progress on partial edge drawings
GD'12 Proceedings of the 20th international conference on Graph Drawing
Collision free region determination by modified polygonal Boolean operations
Computer-Aided Design
A simple algorithm for Boolean operations on polygons
Advances in Engineering Software
Optimizing Pairwise Box Intersection Checking on GPUs for Large-Scale Simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A parallel dual-scanline algorithm for partitioning parameterized 45-degree polygons
ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special Section on Networks on Chip: Architecture, Tools, and Methodologies
Euclidean chains and their shortcuts
Theoretical Computer Science
Robust and efficient polygon overlay on parallel stream processors
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Algorithms for fundamental spatial aggregate operations over regions
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data
DREAMS: DFM rule EvAluation using manufactured silicon
Proceedings of the International Conference on Computer-Aided Design
A comparison of methods for sketch-based 3D shape retrieval
Computer Vision and Image Understanding
| Hi-index | 15.01 |
An interesting class of "geometric intersection problems" calls for dealing with the pairwise intersections among a set of N objects in the plane, These problems arise in many applications such as printed circuit design, architectural data bases, and computer graphics. Shamos and Hoey have described a number of algorithms for detecting whether any two objects in a planar set intersect. In this paper we extend their work by giving algorithms that count the number of such intersections and algorithms that report all such intersections.