Sciweavers

564 search results - page 93 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
QEST
2007
IEEE
15 years 4 months ago
Automated Analysis of Simulation Traces - Separating Progress from Repetitive Behavior
Among the many stages of a simulation study, debugging a simulation model is the one that is hardly reported on but that may consume a considerable amount of time and effort. In t...
Peter Kemper, Carsten Tepper
CORR
2008
Springer
138views Education» more  CORR 2008»
14 years 9 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
IPPS
1998
IEEE
15 years 1 months ago
Sharing Random Bits with No Process Coordination
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Marius Zimand
ICALP
1990
Springer
15 years 1 months ago
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
David P. Dobkin, David G. Kirkpatrick
78
Voted
CGF
2000
96views more  CGF 2000»
14 years 9 months ago
An interactive approach to point cloud triangulation
We present an interactive system for the generation of high quality triangle meshes that allows us to handle hybrid geometry (point clouds, polygons, ...) as input data. In order ...
Leif Kobbelt, Mario Botsch