Sciweavers

34 search results - page 2 / 7
» Trivial Connections on Discrete Surfaces
Sort
View
FOCS
2007
IEEE
13 years 11 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
SGP
2007
13 years 7 months ago
Developable surfaces from arbitrary sketched boundaries
Developable surfaces are surfaces that can be unfolded into the plane with no distortion. Although ubiquitous in our everyday surroundings, modeling them using existing tools requ...
Kenneth Rose, Alla Sheffer, Jamie Wither, Marie-Pa...
SMA
2008
ACM
173views Solid Modeling» more  SMA 2008»
13 years 4 months ago
Visibility-based feature extraction from discrete models
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...
Antoni Chica
CAGD
1999
198views more  CAGD 1999»
13 years 4 months ago
Discrete Coons patches
We investigate surfaces which interpolate given boundary curves. We show that the discrete bilinearly blended Coons patch can be defined as the solution of a linear system. With t...
Gerald E. Farin, Dianne Hansford
CORR
2011
Springer
220views Education» more  CORR 2011»
12 years 12 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers