Computational geometry: an introduction
Computational geometry: an introduction
A fast algorithm for particle simulations
Journal of Computational Physics
Optimal parallel evaluation of tree-structured computations by raking (extended abstract)
VLSI Algorithms and Architectures
Computational structure of the N-body problem
SIAM Journal on Scientific and Statistical Computing
A simple parallel tree contraction algorithm
Journal of Algorithms
An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
Optimal parallel algorithms for polygon and point-set problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The parallel multipole method on the connection machine
SIAM Journal on Scientific and Statistical Computing
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete & Computational Geometry
A unified geometric approach to graph separators
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Relative neighborhood graphs in three dimensions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Separator based parallel divide and conquer in computational geometry
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Multidimensional divide-and-conquer
Communications of the ACM
Approximate complex polynomial evaluation in near constant work per point
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
High performance Fortran for highly irregular problems
PPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming
Efficient algorithms for constructing fault-tolerant geometric spanners
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Electrostatic fields without singularities: theory, algorithms and error analysis
Journal of the ACM (JACM)
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A unifying data structure for hierarchical methods
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
The analysis of a simple k-means clustering algorithm
Proceedings of the sixteenth annual symposium on Computational geometry
Experiences with Parallel N-Body Simulation
IEEE Transactions on Parallel and Distributed Systems
The inverse nearest neighbor problem with astrophysical applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Nice point sets can have nasty Delaunay triangulations
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A practical approach for computing the diameter of a point set
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
ACM SIGACT News
Space-efficient approximate Voronoi diagrams
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Collision detection for deforming necklaces
Proceedings of the eighteenth annual symposium on Computational geometry
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Linear-size approximate voronoi diagrams
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Smooth-surface reconstruction in near-linear time
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Binary space partitions for axis-paralles line segments: size-height tradeoffs
Information Processing Letters
Distribution-Independent Hierarchical Algorithmsfor the N-body Problem
The Journal of Supercomputing
Approximation algorithms for the bottleneck stretch factor problem
Nordic Journal of Computing
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
New Results of Fault Tolerant Geometric Spanners
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
I/O-Efficient Shortest Path Queries in Geometric Spanners
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Approximation Algorithms for the Bottleneck Stretch Factor Problem
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Facility Location and the Geometric Minimum-Diameter Spanning Tree
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Dynamic Compressed Hypertoctrees with Application to the N-Body Problem
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
K-D Trees Are Better when Cut on the Longest Side
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Fault-tolerant geometric spanners
Proceedings of the nineteenth annual symposium on Computational geometry
External memory data structures
Handbook of massive data sets
Well-separated pair decomposition for the unit-disk graph metric and its applications
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
Journal of Experimental Algorithmics (JEA)
Facility location and the geometric minimum-diameter spanning tree
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
Deformable spanners and applications
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Estimating the weight of metric minimum spanning trees in sublinear-time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Collision detection for deforming necklaces
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometrySoCG2002
Dynamic algorithms for approximating interdistances
Nordic Journal of Computing
Fast construction of nets in low dimensional metrics, and their applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Finding the best shortcut in a geometric network
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Space-time tradeoffs for approximate spherical range counting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Small hop-diameter sparse spanners for doubling metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Deformable spanners and applications
Computational Geometry: Theory and Applications
Journal of Computer and System Sciences
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
Distance-preserving approximations of polygonal paths
Computational Geometry: Theory and Applications
Approximate distance oracles for graphs with dense clusters
Computational Geometry: Theory and Applications
Fully dynamic geometric spanners
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Computing a minimum-dilation spanning tree is NP-hard
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Fréchet distance for curves, revisited
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Region-fault tolerant geometric spanners
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On bounded leg shortest paths problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Improved algorithms for fully dynamic geometric spanners and geometric routing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Constructing minimum-interference networks
Computational Geometry: Theory and Applications
Sparse geometric graphs with small dilation
Computational Geometry: Theory and Applications
I/O-efficient algorithms for computing planar geometric spanners
Computational Geometry: Theory and Applications
Data mining on the cell broadband engine
Proceedings of the 22nd annual international conference on Supercomputing
Three-dimensional delaunay refinement for multi-core processors
Proceedings of the 22nd annual international conference on Supercomputing
Well-separated pair decomposition in linear time?
Information Processing Letters
Spanners of Additively Weighted Point Sets
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Computing the Greedy Spanner in Near-Quadratic Time
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
An Optimal Dynamic Spanner for Doubling Metric Spaces
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Geometric spanners with small chromatic number
Computational Geometry: Theory and Applications
Experimental study of geometric t-spanners
Journal of Experimental Algorithmics (JEA)
On the dilation spectrum of paths, cycles, and trees
Computational Geometry: Theory and Applications
Algorithms for graphs of bounded treewidth via orthogonal range searching
Computational Geometry: Theory and Applications
On the Power of the Semi-Separated Pair Decomposition
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Streaming Embeddings with Slack
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Space-time tradeoffs for approximate nearest neighbor searching
Journal of the ACM (JACM)
Deformable spanners and applications
Computational Geometry: Theory and Applications
Journal of Discrete Algorithms
A template for developing next generation parallel Delaunay refinement methods
Finite Elements in Analysis and Design
3-way associative collision warning system
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection
The Journal of Machine Learning Research
Geometric algorithms for agglomerative hierarchical clustering
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Computing geometric minimum-dilation graphs is NP-hard
GD'06 Proceedings of the 14th international conference on Graph drawing
Dynamic algorithms for approximating interdistances
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Experimental study of geometric t-spanners: a running time comparison
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Dilation-optimal edge deletion in polygonal cycles
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Geometric spanners with small chromatic number
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Spanners of complete k-partite geometric graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Localized spanner construction for ad hoc networks with variable transmission range
ACM Transactions on Sensor Networks (TOSN)
Journal of Discrete Algorithms
New constructions of SSPDs and their applications
Proceedings of the twenty-sixth annual symposium on Computational geometry
Approximating the Fréchet distance for realistic curves in near linear time
Proceedings of the twenty-sixth annual symposium on Computational geometry
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Privacy-preserving data-oblivious geometric algorithms for geographic data
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Algorithms and theory of computation handbook
Delaunay triangulations in O(sort(n)) time and more
Journal of the ACM (JACM)
Spanners of additively weighted point sets
Journal of Discrete Algorithms
Comparing distributions and shapes using the kernel distance
Proceedings of the twenty-seventh annual symposium on Computational geometry
The euclidean bottleneck steiner path problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
Quickest paths in anisotropic media
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Performance analysis of a dual-tree algorithm for computing spatial distance histograms
The VLDB Journal — The International Journal on Very Large Data Bases
An Energy-Efficient Resource Allocation Scheme for Mobile Ad Hoc Computational Grids
Journal of Grid Computing
Low-interference networks in metric spaces of bounded doubling dimension
Information Processing Letters
Practical construction of k-nearest neighbor graphs in metric spaces
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
I/O-Efficiently pruning dense spanners
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Distributed proximity maintenance in ad hoc mobile networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Experimental study of geometric t-spanners
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Constructing interference-minimal networks
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Sparse geometric graphs with small dilation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Exact and approximation algorithms for computing the dilation spectrum of paths, trees, and cycles
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximate nearest neighbor search for low dimensional queries
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast pruning of geometric spanners
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
New constructions of SSPDs and their applications
Computational Geometry: Theory and Applications
Balanced aspect ratio trees revisited
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Internally deterministic parallel algorithms can be fast
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Approximate distance oracles for graphs with dense clusters
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
The emergence of sparse spanners and greedy well-separated pair decomposition
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Approximate distance queries in disk graphs
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Using the k-nearest neighbor graph for proximity searching in metric spaces
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Approximate one-to-one point pattern matching
Journal of Discrete Algorithms
A fast and simple surface reconstruction algorithm
Proceedings of the twenty-eighth annual symposium on Computational geometry
Parallel construction of k-nearest neighbor graphs for point clouds
SPBG'08 Proceedings of the Fifth Eurographics / IEEE VGTC conference on Point-Based Graphics
Spanners for geometric intersection graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
GD'12 Proceedings of the 20th international conference on Graph Drawing
On the power of the semi-separated pair decomposition
Computational Geometry: Theory and Applications
Fast query structures in anisotropic media
Theoretical Computer Science
Quickest path queries on transportation network
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Output-sensitive well-separated pair decompositions for dynamic point sets
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Hi-index | 0.01 |
We define the notion of a well-separated pair decomposition of points in d-dimensional space. We then develop efficient sequential and parallel algorithms for computing such a decomposition. We apply the resulting decomposition to the efficient computation of k-nearest neighbors and n-body potential fields.