3025 search results - page 370 / 605 » Computational geometry: a retrospective |
145
click to vote
CVPR
2000
IEEE
15 years 11 months ago
2000
IEEE
We have assembled a standalone, movable system that can capture long sequences of omnidirectional images (up to 1,500 images at 6.7 Hz and a resolution of 1140 × 1030). The goal ...
173
click to vote
COCOON
1999
Springer
15 years 11 months ago
1999
Springer
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...
186
click to vote
FM
1997
Springer
15 years 11 months ago
1997
Springer
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
166
click to vote
ASPDAC
2007
ACM
15 years 11 months ago
2007
ACM
How to estimate the shortest routing length when certain blocks are considered as routing obstacles is becoming an essential problem for block placement because HPWL is no longer v...
203
click to vote
CAIP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper presents a new hybrid split-and-merge image segmentation method based on computational geometry and topology using persistent homology. The algorithm uses edge...