Sciweavers

2980 search results - page 227 / 596
» Computational Geometry
Sort
View
ALGORITHMICA
2010
72views more  ALGORITHMICA 2010»
15 years 5 months ago
Largest and Smallest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
Maarten Löffler, Marc J. van Kreveld
AMC
2007
108views more  AMC 2007»
15 years 5 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
137
Voted
CGF
2007
145views more  CGF 2007»
15 years 5 months ago
Data-driven Tetrahedral Mesh Subdivision
Given a tetrahedral mesh immersed in a voxel model, we present a method to refine the mesh to reduce the discrepancy between interpolated values based on either scheme at arbitra...
L. Rodriguez, Isabel Navazo, Alvar Vinacua
133
Voted
GRAPHITE
2004
ACM
15 years 10 months ago
Robust, geometry-independent shadow volumes
A novel algorithm is presented that overcomes limitations of existing shadow volume algorithms when dealing with nonmanifold geometry and space partitioning. This simple algorithm...
Graham Aldridge, Eric Woods
160
Voted
DGCI
2003
Springer
15 years 10 months ago
On the Use of Shape Primitives for Reversible Surface Skeletonization
We use a mathematical morphology approach to compute the surface and curve skeletons of a 3D object. We focus on the behaviour of the surface skeleton, in particular the reversibil...
Stina Svensson, Pieter P. Jonker