450 search results - page 38 / 90 » Quadrangulations of Planar Sets |
TAMC
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
105
click to vote
3DPVT
2004
IEEE
15 years 3 months ago
2004
IEEE
This paper describes an efficient 3D modeling method from 3D range data-sets that is utilizing range data segmentation. Our algorithm starts with a set of unregistered 3D range sc...
103
click to vote
CCCG
2003
15 years 1 months ago
2003
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
101
click to vote
GRAPHICSINTERFACE
2007
15 years 1 months ago
2007
In this work, we propose and compare several methods for the visualization and exploration of time-varying volumetric medical images based on the temporal characteristics of the d...