3575 search results - page 171 / 715 » Modeling Concurrency with Geometry |
163
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
This paper describes a method to recover scene geometry from the second-bounce of light transport. We show that form factors (up to a scaling ambiguity) can be derived from the sec...
136
Voted
COMPGEOM
1997
ACM
15 years 8 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
138
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
132
Voted
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
136
Voted
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...