Sciweavers

67 search results - page 10 / 14
» Approximate convex decomposition of polygons
Sort
View
SIGGRAPH
1998
ACM
15 years 3 months ago
Visibility Sorting and Compositing Without Splitting for Image Layer Decompositions
We present an efficient algorithm for visibility sorting a set of moving geometric objects into a sequence of image layers which are composited to produce the final image. Inste...
John M. Snyder, Jed Lengyel
CAGD
2008
71views more  CAGD 2008»
14 years 11 months ago
Geometric Lagrange interpolation by planar cubic Pythagorean-hodograph curves
In this paper, the geometric Lagrange interpolation of four points by planar cubic Pythagorean-hodograph (PH) curves is studied. It is shown that such an interpolatory curve exist...
Gasper Jaklic, Jernej Kozak, Marjeta Krajnc, Vito ...
COMPGEOM
2008
ACM
15 years 1 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
CG
1999
Springer
14 years 11 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
ICASSP
2011
IEEE
14 years 3 months ago
Sparse decomposition of transformation-invariant signals with continuous basis pursuit
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
Chaitanya Ekanadham, Daniel Tranchina, Eero P. Sim...