On the Power of the Semi-Separated Pair Decomposition

DOI10.1007/978-3-642-03367-4_1zbMath1253.68324OpenAlexW1582042778MaRDI QIDQ3183436

Mohammad Ali Abam, Mohammad Farshi, Paz Carmi, Michiel H. M. Smid

Publication date: 20 October 2009

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

Full work available at URL: https://ir.library.carleton.ca/pub/4514

Mathematics Subject Classification ID

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

Related Items (3)

New constructions of SSPDs and their applications ⋮ Searching for the closest-pair in a query translate ⋮ New Bounds for Range Closest-Pair Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data structures for range-aggregate extent queries
• Ordered theta graphs
• On separating systems
• Approximating largest convex hulls for imprecise points
• Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
• Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees
• Geometric Spanner Networks
• Delaunay triangulations of imprecise pointsin linear time after preprocessing
• Geometric Spanners for Weighted Point Sets
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Spanners of Complete k-Partite Geometric Graphs

This page was built for publication: On the Power of the Semi-Separated Pair Decomposition