Sciweavers

565 search results - page 45 / 113
» Geometry of Upper Probabilities
Sort
View
COMPGEOM
2006
ACM
14 years 3 months ago
Online geometric reconstruction
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
Bernard Chazelle, C. Seshadhri
COMPGEOM
2004
ACM
14 years 3 months ago
Binary space partitions of orthogonal subdivisions
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
John Hershberger, Subhash Suri, Csaba D. Tó...
COMPGEOM
2003
ACM
14 years 3 months ago
Loops in reeb graphs of 2-manifolds
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
Kree Cole-McLaughlin, Herbert Edelsbrunner, John H...
COCOON
1999
Springer
14 years 2 months ago
On Routing in Circulant Graphs
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
14 years 1 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein