Well-separated pair decomposition

In computational geometry, a well-separated pair decomposition (WSPD) of a set of points , is a sequence of pairs of sets , such that each pair is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2007-2017
01220072017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The notion of distance is fundamental to many aspects of computational geometry. A classic approach to characterize the distance… (More)
  • figure 32.1
  • table 32.1
  • table 32.1
  • figure 32.2
  • figure 32.2
Is this relevant?
2017
2017
The well-separated pair decomposition (WSPD) of the complete Euclidean graph defined on points in R, introduced by Callahan and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
The classic method to depict graphs is a node-link diagram where vertices (nodes) are associated with each object and edges… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
2013
2013
Title of dissertation: DYNAMIC DATA STRUCTURES FOR GEOMETRIC SEARCH AND RETRIEVAL Eunhui Park, 2013 Dissertation directed by… (More)
  • figure 1.1
  • figure 1.2
  • figure 2.1
  • figure 2.2
  • figure 2.3
Is this relevant?
2008
2008
 
Is this relevant?
2007
2007
Well-separated pair decomposition, introduced by Callahan and Kosaraju [3], has found numerous applications in solving proximity… (More)
Is this relevant?