scispace - formally typeset
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

I-COLLIDE: an interactive and exact collision detection system for large-scale environments

TL;DR: An exact and interactive collision detection system for large-scale environments, I-COLLIDE, based on pruning multiple-object pairs using bounding boxes and performing exact collision detection between selected pairs of polyhedral models.
Journal ArticleDOI

Autonomous Helicopter Aerobatics through Apprenticeship Learning

TL;DR: These apprenticeship learning algorithms have enabled us to significantly extend the state of the art in autonomous helicopter aerobatics, including the first autonomous execution of a wide range of maneuvers, including in-place flips, in- place rolls, loops and hurricanes.
Journal ArticleDOI

Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

TL;DR: Given a triangulation of a simple polygonP, linear-time algorithms for solving a collection of problems concerning shortest paths and visibility withinP are presented.
Journal ArticleDOI

Hierarchic Voronoi skeletons

TL;DR: Robust and time-efficient skeletonization of a (planar) shape can be achieved by first regularizing the Voronoi diagram of a shape's boundary points and then by establishing a hierarchic organization of skeleton constituents.

Efficient collision detection for animation and robotics

Ming C. Lin, +1 more
TL;DR: An opportunistic global path planner algorithm which uses the incremental distance computation algorithm to trace out a one-dimensional skeleton for the purpose of robot motion planning and its performance attests their promise for real-time dynamic simulations as well as applications in a computer generated virtual environment.
References
More filters
Journal ArticleDOI

Scalable computational geometry in MapReduce

TL;DR: CG_Hadoop is introduced; a suite of scalable and efficient MapReduce algorithms for various fundamental computational geometry operations, namely polygon union, Voronoi diagram, skyline, convex hull, farthest pair, and closest pair, which present a set of key components for other geometric algorithms.
Journal ArticleDOI

Seven fingers allow force-torque closure grasps on any convex polyhedron

TL;DR: It is proved that a robot hand whose fingers make frictionless contact with a convex polyhedral object will be able to find a grasp where the hand can exert any desired force-torque on the object provided the hand has seven fingers.
Book ChapterDOI

Genericity in Spatial Databases

TL;DR: In 1980, Chandra and Harel investigated, in the context of the relational database model, which queries are “reasonable”, and characterized this class of queries by means of the concept of genericity, which has since taken a central position in the theory of computable queries.
Journal ArticleDOI

On finding widest empty curved corridors

TL;DR: An efficient O(nlog3n)-time algorithm for computing the widest oriented α-siphon through P such that the orientation of a half-line of C is known and an Θ(nlogn)- time algorithm for the widest arbitrarily-oriented α- siphon anchored at a given point is proposed.