Sciweavers

63 search results - page 12 / 13
» On a Geometric Generalization of the Upper Bound Theorem
Sort
View
COMPGEOM
2010
ACM
15 years 1 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
COMGEO
2010
ACM
14 years 9 months ago
Exact join detection for convex polyhedra and other numerical abstractions
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
SIAMCO
2000
89views more  SIAMCO 2000»
14 years 9 months ago
Stability Radius and Internal Versus External Stability in Banach Spaces: An Evolution Semigroup Approach
In this paper the theory of evolution semigroups is developed and used to provide a framework to study the stability of general linear control systems. These include autonomous and...
Stephen Clark, Yuri Latushkin, Stephen Montgomery-...
COMPGEOM
2010
ACM
15 years 2 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
71
Voted
ECCV
2010
Springer
15 years 1 months ago
Analyzing Depth from Coded Aperture Sets
Computational depth estimation is a central task in computer vision and graphics. A large variety of strategies have been introduced in the past relying on viewpoint variations, de...