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
Minimizing interference of a wireless ad-hoc network in a plane
TL;DR: A method based on quad-tree decomposition and bucketing is given that has another provable interference bound in terms of the ratio of the minimum distance to the radius of a uniform-radius ad-hoc network.
Hierarchical Back-Face Culling
Subodh Kumar,Dinesh Manocha +1 more
TL;DR: A sub linear algorithm for computing and culling back facing polygons that yields a signi cant performance improvement in the interactive rendering of large polygonal models.
Journal ArticleDOI
Considering the attractor structure of chaotic maps for observer-based synchronization problems
TL;DR: It is shown that many chaotic maps can be described in a so-called convexified form, involving a time-varying parameter which depends on the chaotic state vector, and it is proved that the conservatism of the polyquadratic stability conditions for the state reconstruction can be reduced when the corresponding Linear Matrix Inequalities involve the vertices of the minimal convex hull of this set.
Journal ArticleDOI
Optimal piecewise linear motion of an object among obstacles
TL;DR: An algorithm for determining the shortest restricted path motion of a polygonal object amidstpolygonal obstacles and a variation of this algorithm which minimizes any positive linear combination of length traversed byP and angular rotation of the ladder aboutP.
Proceedings ArticleDOI
Path planning for encountered-type haptic devices that render multiple objects in 3D space
TL;DR: An automobile virtual control panel was constructed using an encountered-type haptic device in which the proposed path-planning algorithm was implemented and the validity of the proposed algorithm was confirmed and the required performances, such as the device speed and the accuracy of hand tracking were evaluated.
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.