Sciweavers

94 search results - page 6 / 19
» Minimum-Perimeter Intersecting Polygons
Sort
View
CG
1999
Springer
14 years 9 months ago
A visibility algorithm for hybrid geometry- and image-based modeling and rendering
Hybrid geometry- and image-based modeling and rendering systems use photographs taken of a real-world environment and mapped onto the surfaces of a 3D model to achieve photorealis...
Thomas A. Funkhouser
CAD
2011
Springer
14 years 1 months ago
Parameterization and applications of Catmull-Rom curves
The behavior of Catmull-Rom curves heavily depends on the choice of parameter values at the control points. We analyze a class of parameterizations ranging from uniform to chordal...
Cem Yuksel, Scott Schaefer, John Keyser
SIBGRAPI
2006
IEEE
15 years 3 months ago
Polygonization of volumetric reconstructions from silhouettes
In this work we propose a method for the polygonization of octree-based reconstructions by dual contouring. Dual contouring is an adaptive method for determining contiguous polygo...
Anselmo Antunes Montenegro, Luiz Velho, Paulo Ceza...
COCOON
2001
Springer
15 years 2 months ago
Packing Two Disks into a Polygonal Environment
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
Prosenjit Bose, Pat Morin, Antoine Vigneron
COMBINATORICS
1999
139views more  COMBINATORICS 1999»
14 years 9 months ago
A Closer Look at Lattice Points in Rational Simplices
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
Matthias Beck