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
Efficiency evaluation in data envelopment analysis using strong defining hyperplanes
TL;DR: A new DEA-based algorithm is developed, and it is shown how one can combine the procedure with a known beneath-and-beyond procedure to reduce the computational burden.
Journal ArticleDOI
Multi-MAV Autonomous Full Coverage Search in Cluttered Forest Environments
TL;DR: This work proposes a two-stage multi-MAV forest search strategy that improves the efficiency of coverage path planning for cooperative search and guarantees full area coverage.
Journal ArticleDOI
Models and methods for One-Dimensional Space Allocation Problem with forbidden zones
G. G. Zabudsky,N. S. Veremchuk +1 more
Journal ArticleDOI
Graph Dynamics of Solar Active Regions: Morse-Smale Complexes and Multiscale Graphs of Magnetograms
TL;DR: In this article, a model for the evolution of an active region (AR) in which the graph constructed from the singular points of the magnetic field codes the AR magnetic patterns is discussed.
Parallel Computing: The Elephant in the Room
TL;DR: This paper seeks to directly identify the barriers to parallel computation and concludes that the barriers are not, as conventional wisdom might hold, a lack of programmer ingenuity or research funding, rather, the limitations are fundamental to the problems addressed; new computer architectures and compilers offer limited benefit.
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.