Sciweavers

87 search results - page 1 / 18
» Separation and Approximation of Polyhedral Objects
Sort
View
83
Voted
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
14 years 11 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
MP
2010
94views more  MP 2010»
14 years 8 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
COMGEO
2008
ACM
14 years 10 months ago
Approximating polyhedral objects with deformable smooth surfaces
We propose a method to approximate a polyhedral object with a deformable smooth surface, namely the t-skin defined by Edelsbrunner
Ho-Lun Cheng, Tony Tan
89
Voted
SIGGRAPH
1995
ACM
15 years 1 months ago
Modeling surfaces of arbitrary topology using manifolds
We describe an extension of B-splines to surfacesof arbitrary topology, including arbitrary boundaries. The technique inherits many of the properties of B-splines: local control, ...
Cindy Grimm, John F. Hughes
127
Voted
DCG
2010
289views more  DCG 2010»
14 years 10 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...