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

Lower bounds for algebraic decision trees

TL;DR: A topological method is given for obtaining lower bounds for the height of algebraic decision trees and an Ω(n2) bound is obtained for trees with bounded-degree polynomial tests, thus extending the Dobkin-Lipton result for linear trees.
Journal ArticleDOI

Parameter-controlled volume thinning

TL;DR: This paper describes an algorithm which uses a thinness parameter to control the thinning process and thus the density of the skeletal structure and presents applications from CFD and medical visualization and shows how the skeletalructure can be used in these domains.
Journal ArticleDOI

Online Routing in Triangulations

TL;DR: This work considers online routing algorithms for routing between the vertices of embedded planar straight line graphs and presents two deterministic memoryless routing algorithms and a randomized memoryless algorithm that works for all triangulations.
Journal ArticleDOI

A linear algorithm for finding the convex hull of a simple polygon

TL;DR: A new linear time algorithm for determining the convex hull of a set of n points in the plane is presented and the validity of this algorithm is proved.

Geometric transforms for fast geometric algorithms

TL;DR: This thesis describes several geometric problems whose solutions illustrate the use of geometric transforms, including fast algorithms for intersecting half-spaces, constructing Voronoi diagrams, and computing the Euclidean diameter of a set of points.