Voronoi diagrams—a survey of a fundamental geometric data structure
F Aurenhammer - ACM Computing Surveys (CSUR), 1991 - dl.acm.org
Computational geometry is concerned with the design and analysis of algorithms for
geometrical problems. In addition, other more practically oriented, areas of computer …
geometrical problems. In addition, other more practically oriented, areas of computer …
[PDF][PDF] Approximation algorithms for geometric problems
M Bern, D Eppstein - Approximation algorithms for NP-hard problems, 1997 - Citeseer
This chapter surveys approximation algorithms for hard geometric problems. The problems
we consider typically take inputs that are point sets or polytopes in two-or three-dimensional …
we consider typically take inputs that are point sets or polytopes in two-or three-dimensional …
Cluster analysis and mathematical programming
Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are
homogeneous and/or well separated. As many types of clustering and criteria for …
homogeneous and/or well separated. As many types of clustering and criteria for …
Voronoi Diagrams.
F Aurenhammer, R Klein - Handbook of computational geometry, 2000 - books.google.com
The topic of this chapter, Voronoi diagrams, differs from other areas of computational
geometry, in that its origin dates back to the 17th century. In his book on the principles of …
geometry, in that its origin dates back to the 17th century. In his book on the principles of …
Randomized incremental construction of Delaunay and Voronoi diagrams
In this paper we give a new randomized incremental algorithm for the construction of planar
Voronoi diagrams and Delaunay triangulations. The new algorithm is more “on-line” than …
Voronoi diagrams and Delaunay triangulations. The new algorithm is more “on-line” than …
Random convex programs
GC Calafiore - SIAM Journal on Optimization, 2010 - SIAM
Random convex programs (RCPs) are convex optimization problems subject to a finite
number N of random constraints. The optimal objective value J^* of an RCP is thus a …
number N of random constraints. The optimal objective value J^* of an RCP is thus a …
Maximum co-located community search in large scale social networks
The problem of k-truss search has been well defined and investigated to find the highly
correlated user groups in social networks. But there is no previous study to consider the …
correlated user groups in social networks. But there is no previous study to consider the …
Spanning trees—short or small
We study the problem of finding small trees. Classical network design problems are
considered with the additional constraint that only a specified number k of nodes are …
considered with the additional constraint that only a specified number k of nodes are …
Collective spatial keyword queries: a distance owner-driven approach
Recently, spatial keyword queries become a hot topic in the literature. One example of these
queries is the collective spatial keyword query (CoSKQ) which is to find a set of objects in …
queries is the collective spatial keyword query (CoSKQ) which is to find a set of objects in …
Closest-point problems in computational geometry
M Smid - Handbook of computational geometry, 2000 - Elsevier
Closest-Point Problems in Computational Geometry - ScienceDirect Skip to main contentSkip
to article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full …
to article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full …