Sciweavers

138 search results - page 27 / 28
» K-Guarding Polygons on the Plane
Sort
View
VMV
2001
91views Visualization» more  VMV 2001»
13 years 9 months ago
A Robust Procedure to Eliminate Degenerate Faces from Triangle Meshes
When using triangle meshes in numerical simulations or other sophisticated downstream applications, we have to guarantee that no degenerate faces are present since they have, e.g....
Mario Botsch, Leif Kobbelt
IJRR
2008
115views more  IJRR 2008»
13 years 7 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
DCG
2007
102views more  DCG 2007»
13 years 7 months ago
How to Exhibit Toroidal Maps in Space
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
Dan Archdeacon, C. Paul Bonnington, Joanna A. Elli...
CGA
2000
13 years 7 months ago
Metamorphosis of Arbitrary Triangular Meshes
Recently, animations with deforming objects have been frequently used in various computer graphics applications. Metamorphosis (or morphing) of three-dimensional objects is one of...
Takashi Kanai, Hiromasa Suzuki, Fumihiko Kimura
COMPGEOM
1994
ACM
13 years 11 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir