Sciweavers

RT
1998
Springer
13 years 8 months ago
Efficient View-Dependent Image-Based Rendering with Projective Texture-Mapping
Abstract. This paper presents how the image-based rendering technique of viewdependent texture-mapping (VDTM) can be efficiently implemented using projective texture mapping, a fea...
Paul E. Debevec, Yizhou Yu, George Borshukov
COMPGEOM
1998
ACM
13 years 9 months ago
Rotational Polygon Containment and Minimum Enclosure
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
Victor Milenkovic
ISAAC
1999
Springer
91views Algorithms» more  ISAAC 1999»
13 years 9 months ago
Convexifying Monotone Polygons
This paper considers recon gurations of polygons, where each polygon edge is a rigid link, no two of which can cross during the motion. We prove that one can recon gure any monoton...
Therese C. Biedl, Erik D. Demaine, Sylvain Lazard,...
VISUALIZATION
2002
IEEE
13 years 9 months ago
Compressing Polygon Mesh Geometry with Parallelogram Prediction
In this paper we present a generalization of the geometry coder by Touma and Gotsman [34] to polygon meshes. We let the polygon information dictate where to apply the parallelogra...
Martin Isenburg, Pierre Alliez
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
13 years 10 months ago
Online Occlusion Culling
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...
Gereon Frahling, Jens Krokowski
ICCV
2005
IEEE
13 years 10 months ago
More-Than-Topology-Preserving Flows for Active Contours and Polygons
Active contour and active polygon models have been used widely for image segmentation. In some applications, the topology of the object(s) to be detected from an image is known a ...
Ganesh Sundaramoorthi, Anthony J. Yezzi
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
13 years 10 months ago
Coverage Diameters of Polygons
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
Pawin Vongmasa, Attawith Sudsang
LATIN
2010
Springer
13 years 11 months ago
Optimal Polygonal Representation of Planar Graphs
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
Emden R. Gansner, Yifan Hu, Michael Kaufmann, Step...