Sciweavers

2093 search results - page 262 / 419
» Statistical Point Geometry
Sort
View
118
Voted
COMPGEOM
2010
ACM
15 years 7 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
2007
ACM
15 years 6 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
129
Voted
DGCI
2009
Springer
15 years 5 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
COMPGEOM
2008
ACM
15 years 4 months ago
Discrete laplace operator on meshed surfaces
In recent years a considerable amount of work in graphics and geometric optimization used tools based on the Laplace-Beltrami operator on a surface. The applications of the Laplac...
Mikhail Belkin, Jian Sun, Yusu Wang
132
Voted
BMCBI
2010
139views more  BMCBI 2010»
15 years 2 months ago
A global optimization algorithm for protein surface alignment
Background: A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined w...
Paola Bertolazzi, Concettina Guerra, Giampaolo Liu...