Sciweavers

COMPGEOM
2010
ACM
13 years 8 months ago
Topological inference via meshing
Benoît Hudson, Gary L. Miller, Steve Oudot, ...
COMPGEOM
2010
ACM
13 years 8 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...
COMPGEOM
2010
ACM
13 years 8 months ago
Geometric tomography with topological guarantees
We consider the problem of reconstructing a compact 3manifold (with boundary) embedded in R3 from its crosssections with a given set of cutting planes having arbitrary orientation...
Omid Amini, Jean-Daniel Boissonnat, Pooran Memari
COMPGEOM
2010
ACM
13 years 8 months ago
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
Micha Sharir, Adam Sheffer, Emo Welzl
COMPGEOM
2010
ACM
13 years 8 months ago
Lines avoiding balls in three dimensions revisited
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
Natan Rubin
COMPGEOM
2010
ACM
13 years 8 months ago
Dynamic well-spaced point sets
Umut A. Acar, Andrew Cotter, Benoît Hudson, ...
COMPGEOM
2010
ACM
13 years 8 months ago
Improving the first selection lemma in R3
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfra...
COMPGEOM
2010
ACM
13 years 8 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
COMPGEOM
2010
ACM
13 years 8 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
COMPGEOM
2010
ACM
13 years 8 months ago
New constructions of SSPDs and their applications
Mohammad Ali Abam, Sariel Har-Peled