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
A gripper design algorithm for grasping a set of parts in manufacturing lines
TL;DR: The goal is to make a gripper such that it will be a commodity similar to the robot arms, and the algorithm, termed 3D-OCOG (3-Dimensional Objects COmmon Grasp search) and proposed in this paper, searches for a common grasp configuration over a set of spatial objects.
Confidentiality and integrity in distributed data exchange
Gerome Miklau,Dan Suciu +1 more
TL;DR: A flexible fine-grained encryption framework is proposed which allows data owners to construct, from a set of access policies, a single encrypted database that can be stored and exchanged by all parties that can significantly advance the security of distributed data exchange.
Book ChapterDOI
An Improved Algorithm for Subdivision Traversal without Extra Storage
Prosenjit Bose,Pat Morin +1 more
TL;DR: This work describes an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant amount of memory beyond that required to store the subdivision.
Journal ArticleDOI
Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing
Martin Bähr,Johannes Buhl,Georg Radow,Johannes Schmidt,Markus Bambach,Michael Breuß,Armin Fügenschuh +6 more
TL;DR: To find an optimal tool path guaranteeing minimal production time and high quality of the workpiece, a mixed-integer linear programming problem is derived that takes thermal conduction and radiation during the process into account and aims to minimize temperature gradients inside the material.
Proceedings ArticleDOI
Simulation of EUV multilayer mirror buried defects
TL;DR: In this paper, a new interface has been created to link existing deposition/etching and electromagnetic simulation software, allowing the user to program deposition and etching conditions and then find the reflective properties of the resultant structure.
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.