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
Journal ArticleDOI
Object Pose Estimation in Accommodation Space using an Improved Fruit Fly Optimization Algorithm
TL;DR: The results show that the application of convex hull algorithm can significantly simplify a target object reducing the running time, and half individuals of the population guide the entire population to search for an optimal pose (6 degrees of freedom) in accommodation space.
Journal ArticleDOI
Packing two disks into a polygonal environment
TL;DR: A simple randomized algorithm whose expected running time, on any input, is O( n log n ), which is optimal in the algebraic decision tree model of computation.
Journal ArticleDOI
Triangulations without minimum-weight drawing
TL;DR: The problem of does every triangulation graph whose skeleton is a forest admit a minimum-weight drawing is answered by disproving it in the general case and even when the skeleton is restricted to a tree or, in particular, a star.
Journal ArticleDOI
Selected Applications of Linear Semi-Infinite Systems Theory
TL;DR: In this article, the authors review the main known results on systems of an arbitrary (possibly infinite) number of weak linear inequalities posed in the Euclidean space, and show the potential power of this theoretical tool by developing in detail two significant applications, one to computational geometry: the Voronoi cells, and the other to mathematical analysis.
Journal ArticleDOI
<tt>DIRECTGO</tt> : A New <tt>DIRECT</tt> -Type <tt>MATLAB</tt> Toolbox for Derivative-Free Global Optimization
TL;DR: DirectGO as discussed by the authors is a MATLAB toolbox for derivative-free global optimization with a graphical user interface (GUI) that allows the use of all functionalities available in DIRECTGO.
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.