Sciweavers

1136 search results - page 2 / 228
» Finding Small Holes
Sort
View
WSCG
2004
185views more  WSCG 2004»
13 years 10 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang
CCCG
2010
13 years 10 months ago
Watchman tours for polygons with holes
A watchman tour in a polygonal domain (for short, polygon) is a closed curve such that every point in the polygon is visible from at least one point of the tour. The problem of fin...
Adrian Dumitrescu, Csaba D. Tóth
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 8 months ago
Peer-to-Peer Communication Across Network Address Translators
Network Address Translation (NAT) causes well-known difficulties for peer-to-peer (P2P) communication, since the peers involved may not be reachable at any globally valid IP addre...
Bryan Ford, Pyda Srisuresh, Dan Kegel
ICRA
2002
IEEE
103views Robotics» more  ICRA 2002»
14 years 1 months ago
Spreading and Isolating Multiple Stacked Cards using Absorptive Hole Array
A new approach to the separation of multiple stacked cards is presented. Separation of multiple stacked cards is a key operation in many mechatronic devices such as copy machines ...
Shinichi Hirai, Masamitsu Ukai, Ken Yamada, Koji S...
JIIS
2006
76views more  JIIS 2006»
13 years 8 months ago
Holes in joins
A join of two relations in real databases is usually much smaller than their cartesian product. This means that most of the combinations of tuples in the crossproduct of the respe...
Jarek Gryz, Dongming Liang