The power of geometric duality

@article{Chazelle1985ThePO,
  title={The power of geometric duality},
  author={Bernard Chazelle and Leonidas J. Guibas and Der-Tsai Lee},
  journal={BIT Numerical Mathematics},
  year={1985},
  volume={25},
  pages={76-90}
}
This paper uses a new formulation of the notion of duality that allows the unified treatment of a number of geometric problems. In particular, we are able to apply our approach to solve two long-standing problems of computational geometry: one is to obtain a quadratic algorithm for computing the minimum-area triangle with vertices chosen amongn points in the plane; the other is to produce an optimal algorithm for the half-plane range query problem. This problem is to preprocessn points in the… Expand
New applications of random sampling in computational geometry
  • K. Clarkson
  • Mathematics, Computer Science
  • Discret. Comput. Geom.
  • 1987
This paper gives several new demonstrations of the usefulness of random sampling techniques in computational geometry. One new algorithm creates a search structure for arrangements of hyperplanes byExpand
Solving query-retrieval problems by compacting Voronoi diagrams
TLDR
The fundamental idea is that k'h-order Voronoi diagrams can be compacted from k°(1)n space to O(n) space and still retain all the information that is essential for solving query problems and may be useful in improving the memory space requirement or the query-time bound for other query-retrieval problems. Expand
Canonical Polygon Queries on the Plane: A New Approach
TLDR
This work studies the problem of canonical k-vertex polygon queries on the plane and presents two new algorithms for this problem, which consumes O(n 2 ) space and O(k logn/loglogn + A) query time, where k is the number of vertices. Expand
On Geometric Range Searching, Approximate Counting and Depth Problems
TLDR
This thesis obtains the first optimal data structure for approximate halfspace range counting in 3D and provides two nontrivial methods to approximate the simplicial depth of a given point in higher dimension. Expand
On the Canonical k-vertex Polygon Spatial Retrieval Problem ∗
The polygon retrieval problem on points is the problem of preprocessing a set of n points on the plane, so that given a polygon query, the subset of points lying inside it can be reportedExpand
Polytope range searching and integral geometry
  • B. Chazelle
  • Mathematics, Computer Science
  • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
TLDR
It is proved that the worst-case query time is 0. Expand
Visibility in Simple Polygons
TLDR
A new method of decomposing a simple polygon is presented which allows the preprocessing of the polygon to be used to answer queries of various forms, and it is shown that there can be (n3) distinct visibility regions, each of which can see (n) points. Expand
CHAPTER 7 – Computational Geometry
TLDR
This chapter discusses a wide range of topics in computational geometry, including the Euclidean Minimum Spanning Tree problem and the Euclidesan Travelling Salesman problem, which stand out for their special interest. Expand
Results in computational geometry: geometric embeddings and query-retrieval problems
Abstract : Many fundamental questions in computational geometry arise from the consideration of distributions of points in euclidean space. This thesis explores two important ares of computationalExpand
Lower bounds for set intersection queries
TLDR
It is shown that any algorithm that fits in this model of computation must take time Ω(q+n√q) to process a sequence ofn updates andq queries, ignoring factors that are polynomial in logn. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 17 REFERENCES
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
TLDR
Two algorithms are given, one that constructs the Voronoi diagram of the given sites, and another that inserts a new site in O(n) time, based on the use of the Vor onoi dual, the Delaunay triangulation, and are simple enough to be of practical value. Expand
A 3-space partition and its applications
  • F. F. Yao
  • Mathematics, Computer Science
  • STOC
  • 1983
TLDR
It is shown that one can always find three planes that divide S into eight open regions, of which no seven together contain more than n points, which gives rise to a data structure, what is called an octant-tree, for representing any point set in 3-space. Expand
Geometric transforms for fast geometric algorithms
Many computational problems are inherently geometrical in nature. For example, cluster analysis involves construction of convex hulls of sets of points, LSI artwork analysis requires a test forExpand
Maintenance of Configurations in the Plane
TLDR
A fully dynamic maintenance algorithm for convex hulls that can process insertions and deletions of single points in only O(log* n) steps per transaction, where n is the number of points currently in the set. Expand
Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time
TLDR
A new data structure is described which stores S in O(n) space and allows us to answer a halfplanar range query in O (n log 2 (1+√5)−1) time in the worst case, thus improving the best result known before. Expand
Constructing Arrangements of Lines and Hyperplanes with Applications
TLDR
An algorithm is presented that constructs a representation for the cell complex defined by n hyperplanes in optimal $O(n^d )$ time in d dimensions, which is shown to lead to new methods for computing $\lambda $-matrices, constructing all higher-order Voronoi diagrams, halfspatial range estimation, degeneracy testing, and finding minimum measure simplices. Expand
Finding the Intersection of two Convex Polyhedra
TLDR
An algorithm to test whether their intersection is empty, and if so to find a separating plane, and to construct their intersection polyhedron is developed, which runs in timeO (n log n), where n is the sum of the numbers of vertices of the two polyhedra. Expand
Constructing arrangements of lines and hyperplanes with applications
TLDR
An optimal algorithm is presented for constructing an arrangement of hyperplanes in arbitrary dimensions and is shown to improve known worst-case time complexities for five problems: computing all order-k Voronoi diagrams, computing the λ-matrix, estimating halfspace queries, degeneracy testing, and finding the minimum volume simplex determined by a set of points. Expand
Optimal Search in Planar Subdivisions
TLDR
This work presents a practical algorithm for subdivision search that achieves the same (optimal) worst case complexity bounds as the significantly more complex algorithm of Lipton and Tarjan, namely $O(\log n)$ search time with $O(n)$ storage. Expand
Detection is easier than computation (Extended Abstract)
TLDR
For this problem, none of the previous lower bounds are valid and it is proposed algorithms requiring sublinear time for their solution in 2 and 3 dimensions. Expand
...
1
2
...