Finding Pairwise Intersections Inside a Query Range

DOI10.1007/978-3-319-21840-3_20zbMath1444.68058OpenAlexW3021796794MaRDI QIDQ3449820

Ali D. Mehrabi, Joachim Gudmundsson, Mark T. de Berg

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/finding-pairwise-intersections-inside-a-query-range(97542e84-500b-4e21-bb73-b326356e3296).html

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Algorithms for bichromatic line-segment problems and polyhedral terrains
• Applications of random sampling in computational geometry. II
• On a class of \(O(n^ 2)\) problems in computational geometry
• Range-Aggregate Queries Involving Geometric Aggregation Operations
• Some methods of computational geometry applied to computer graphics
• Optimal Point Location in a Monotone Subdivision
• Filtering Search: A New Approach to Query-Answering
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Improved Bounds for the Union of Locally Fat Objects in the Plane

This page was built for publication: Finding Pairwise Intersections Inside a Query Range