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
Book ChapterDOI
Towards Soft Exact Computation (Invited Talk)
TL;DR: A bird’s eye view of the recent work with collaborators in two principle areas: computing zero sets and robot path planning and a systematic pathway to go from the abstract algorithmic description to an effective algorithm in the subdivision framework are discussed.
Journal ArticleDOI
Three-dimensional view-invariant face recognition using a hierarchical pose-normalization strategy
Martin D. Levine,Ajit Rajwade +1 more
TL;DR: A 3D face recognition system capable of recognizing the identity of an individual from a 3D facial scan in any pose across the view-sphere, by suitably comparing it with a set of models stored in a database.
Proceedings ArticleDOI
An Edge-Preserving, Data-Dependent Triangulation Scheme for Hierarchical Rendering
TL;DR: A new data-dependent triangulation scheme for multi-valued scattered data in the plane that preserves edges (discontinuities) that might exist in a given data set by placing vertices close to edges.
Journal ArticleDOI
Convex hulls of sierpiński relatives
Tara Taylor,S. Rowley +1 more
TL;DR: In this article, the convex hulls of the Sierpinski relatives were investigated and it was shown that they all have the same fractal dimension but different topologies.
Journal ArticleDOI
On the optimal separating hyperplane for arbitrary sets: a generalization of the SVM formulation and a convex hull approach
Ademir A. Ribeiro,Mael Sachine +1 more
TL;DR: In this article, the authors generalize the existing formulation and results on linear separability of sets and use the concepts of convex hulls to characterize the solution of the generalized problem.
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.