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
Proceedings ArticleDOI
Robotic arm control design using piecewise Lyapunov function: An LMI approach
TL;DR: This paper starts by constructing piecewise-quadratic Lyapunov functions for stability achievement and designing of state feedback controllers for continuous time fuzzy systems, and designs a fuzzy output feedback controller, which is a two-link robot manipulator.
Journal ArticleDOI
On Reconfiguration Graphs of Independent Sets Under Token Sliding
David Avis,Duc A. Hoang +1 more
TL;DR: In this article , the authors studied the structure and realizability of reconfiguration graphs and gave a decomposition result for splitting a reconfigurative graph into smaller pieces, and showed that if a given graph G satisfies some property (e.g., s-partitedness, planarity, Eulerianity, girth, and the clique size) then it also belongs to a certain class of graphs.
Book ChapterDOI
Measuring the orientability of shapes
TL;DR: Several existing orientability measures are discussed and several new orientable measures are introduced and the measures are compared and tested on synthetic and real data.
An Algorithm for Packing Circles of Two Types in a Fixed Size Container with Non-Euclidean Metric.
TL;DR: The paper deals with the problem of optimal packing of two sets of circles (2-D spheres) into a simply connected container based on optical-geometric approach, which is developed by the authors in recent years and previously used only for packing circles of equal radius.
Book ChapterDOI
An Effective Boundary Point Detection Algorithm Via k-Nearest Neighbors-Based Centroid
TL;DR: In this paper, a boundary point detection algorithm based on the concept of kNN-based centroid which has low dependence on parameters, high precision and can detect outliers at the same time is proposed.
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.