Sciweavers

2249 search results - page 131 / 450
» Representations for category disambiguation
Sort
View
CGF
2010
146views more  CGF 2010»
15 years 6 months ago
Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
Marcel Campen, Leif Kobbelt
CORR
2008
Springer
136views Education» more  CORR 2008»
15 years 6 months ago
Matrix Graph Grammars
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previ...
Pedro Pablo Pérez Velasco
CGF
2007
82views more  CGF 2007»
15 years 6 months ago
Unpopping: Solving the Image-Space Blend Problem for Smooth Discrete LOD Transitions
This paper presents a new, simple and practical algorithm to avoid artifacts when switching between discrete levels of detail (LOD) by smoothly blending LOD representations in ima...
Markus Giegl, Michael Wimmer
CGF
2007
158views more  CGF 2007»
15 years 6 months ago
Soft Articulated Characters with Fast Contact Handling
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
Nico Galoppo, Miguel A. Otaduy, Serhat Tekin, Mark...
TC
2008
15 years 6 months ago
Converting to and from Dilated Integers
Abstract-- Dilated integers form an ordered group of the cartesian indices into a d-dimensional array represented in Morton order. Efficient implementations of its operations can b...
Rajeev Raman, David S. Wise