Sciweavers

2188 search results - page 112 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
CIARP
2004
Springer
15 years 8 months ago
Refined Method for the Fast and Exact Computation of Moment Invariants
Geometric moments have been proven to be a very efficient tool for description and recognition of binary shapes. Numerous methods for effective calculation of image moments have be...
Juan Humberto Sossa Azuela, Jan Flusser
153
Voted
TVCG
2011
136views more  TVCG 2011»
14 years 9 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
221
Voted
COMPGEOM
2011
ACM
14 years 6 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
111
Voted
GRAPHITE
2004
ACM
15 years 8 months ago
Robust, geometry-independent shadow volumes
A novel algorithm is presented that overcomes limitations of existing shadow volume algorithms when dealing with nonmanifold geometry and space partitioning. This simple algorithm...
Graham Aldridge, Eric Woods
COMPGEOM
2000
ACM
15 years 6 months ago
Fast software for box intersections
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
Afra Zomorodian, Herbert Edelsbrunner