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
Shape-Faithful Graph Drawings
TL;DR: Wang et al. as mentioned in this paper presented ShFR and ShSM, algorithms for shape-faithful drawings based on force-directed and stress-based algorithms, by introducing new proximity forces/stress.
Journal ArticleDOI
Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
TL;DR: In this article , the weighted Tchebycheff scalarization is applied to multiobjective discrete optimization problems, where the objective is to minimize the weighted maximum distance of the image of a feasible solution to some desirable reference point.
Journal ArticleDOI
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead
TL;DR: In this paper , a linear-size data structure for maintaining the lower envelope of a set of monotone pseudo-lines in the plane was proposed, which can handle insertion/deletion of a pseudo-line in O((k+1) \log 2 n)$ time, where n is the current number of unit disks and k is the combinatorial complexity of the structural change due to the insertion of a new disc.
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.