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
Leonidas J. Guibas,John Hershberger,Daniel Leven,Micha Sharir,Micha Sharir,Robert E. Tarjan,Robert E. Tarjan +6 more
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
Robert L. Ogniewicz,Olaf Kübler +1 more
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,John Canny +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
On the computation of the affine skeletons of planar curves and the detection of skew symmetry
TL;DR: A new approach to compute discrete skeletons of planar shapes which is based on affine distances, being therefore affine invariant, is discussed, and an efficient implementation of the method is proposed and examples are given.
Journal ArticleDOI
Thread-based implementations of the false nearest neighbors method
I. Marín Carrión,E. Arias Antúnez,M. M. Artigao Castillo,J.J. Águila Guerrero,J. J. Miralles Canals +4 more
TL;DR: Three parallel implementations of the False Nearest Neighbors method for shared memory architectures are described and it is indicated that the three parallel approaches are between 25 and 75 times faster than the sequential one.
Book ChapterDOI
Triangle Mesh Duality: Reconstruction and Smoothing
TL;DR: The definition of the “dual Laplacian smoothing” is defined, which combines the application to the dual mesh of well-known smoothing algorithms with an inverse transformation for reconstructing the regularized triangle mesh.
Posted Content
Efficient Data Optimisation for Harmonic Inpainting with Finite Elements
TL;DR: This work replaces the standard finite differences discretisation by a finite element method with triangle elements and proposes highly efficient algorithms for spatial and tonal data optimisation that are several orders of magnitude faster than state-of-the-art methods.
Book ChapterDOI
Oriented k-windows: A PCA driven clustering method
TL;DR: The application of Principal Component Analysis on subsets of the dataset to better approximate clusters is presented and it is shown that the resulting algorithm, called Oriented k-Windows (OkW), is able to steer the clustering procedure by effectively capturing several coexisting clusters of different orientation.