Sciweavers

CORR
2010
Springer
102views Education» more  CORR 2010»
14 years 9 months ago
On Flat Polyhedra deriving from Alexandrov's Theorem
We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to re...
Joseph O'Rourke
CGF
2010
99views more  CGF 2010»
14 years 9 months ago
Trivial Connections on Discrete Surfaces
This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities ...
Keenan Crane, Mathieu Desbrun, Peter Schröder
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
15 years 14 days ago
On the Complexity of Intersecting Finite State Automata
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
15 years 10 months ago
Computing Distance Histograms Efficiently in Scientific Databases
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
Yi-Cheng Tu, Shaoping Chen, Sagar Pandit