Open Access
Computational geometry.
Reads0
Chats0
About:
The article was published on 1978-01-01 and is currently open access. It has received 366 citations till now. The article focuses on the topics: Computational geometry.read more
Citations
More filters
Dissertation
Wavelet-Based Multiresolution Surface Approximation from Height Fields
TL;DR: This dissertation concerns the use of wavelet-based MRA methods to produce a triangular-mesh surface approximation from a single height field dataset, using a small number of approximating elements to satisfy a given error criterion.
Journal ArticleDOI
Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
TL;DR: The orthogonal range searching problem and the exact nearest neighbor searching problem for a static set of n points when the dimension d is moderately large is revisited and the problem can be reduced to the Boolean Orthogonal vectors problem.
Journal ArticleDOI
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
TL;DR: In this article, the authors presented an algorithm to compute the rectilinear convex hull of P in O(n ε log n) time and O (n) space.
Proceedings ArticleDOI
The new window density function for efficient evolutionary unsupervised clustering
TL;DR: A novel objective function is proposed that can provide fitness function values in sub-linear time and an evolutionary scheme was developed to evolve cluster solutions and it was demonstrated how the number of clusters can be estimated from the final result.
Book ChapterDOI
Load Balancing in High Performance GIS: Declustering Polygonal Maps
TL;DR: A high performance geographic information system (GIS) is a central component of many real-time applications of spatial decision making and can be obtained only with major advances in exploiting parallelism and spatial database techniques within the computational geometry algorithms for range and map-overlay queries.
References
More filters
Journal ArticleDOI
Shortest connection networks and some generalizations
TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.
Journal ArticleDOI
An efficient algorith for determining the convex hull of a finite planar set
TL;DR: P can be chosen to I&E the centroid oC the triangle formed by X, y and z and Express each si E S in polar coordinates th origin P and 8 = 0 in the direction of zu~ arhitnry fixed half-line L from P.
Journal ArticleDOI
A Separator Theorem for Planar Graphs
TL;DR: In this paper, it was shown that the vertices of a planar graph can be partitioned into three sets A, B, C such that no edge joins a vertex in A with another vertex in B, neither A nor B contains more than ${2n/3}$ vertices, and C contains no more than $2.
A separator theorem for planar graphs
TL;DR: In this paper, it was shown that the vertices of a planar graph can be partitioned into three sets A,B,C such that no edge joins a vertex in A with another vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than $2.
Journal ArticleDOI
Applications of a Planar Separator Theorem
TL;DR: Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(√n) vertices, and this separator theorem in combination with a divide-and-conquer strategy leads to many new complexity results for planar graphs problems.