Sciweavers

2877 search results - page 480 / 576
» The Complexity of Planarity Testing
Sort
View
124
Voted
TOG
1998
98views more  TOG 1998»
15 years 3 months ago
V-Clip: Fast and Robust Polyhedral Collision Detection
This paper presents the Voronoi-clip, or V-clip, collision detection algorithm for polyhedral objects specified by a boundary representation. V-clip tracks the closest pair of fe...
Brian Mirtich
TROB
2002
138views more  TROB 2002»
15 years 3 months ago
Interference-free polyhedral configurations for stacking
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
Venkateswara R. Ayyadevara, David A. Bourne, Kenji...
PVLDB
2010
129views more  PVLDB 2010»
15 years 2 months ago
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques
Graphs are of growing importance in modeling complex structures such as chemical compounds, proteins, images, and program dependence. Given a query graph Q, the subgraph isomorphi...
Wook-Shin Han, Jinsoo Lee, Minh-Duc Pham, Jeffrey ...
UMUAI
2010
136views more  UMUAI 2010»
15 years 2 months ago
Towards affective camera control in games
Information about interactive virtual environments, such as games, is perceived by users through a virtual camera. While most interactive applications let users control the camera,...
Georgios N. Yannakakis, Héctor Perez Mart&i...
ICPR
2010
IEEE
15 years 1 months ago
Patch-Based Similarity HMMs for Face Recognition with a Single Reference Image
In this paper we present a new architecture for face recognition with a single reference image, which completely separates the training process from the recognition process. In th...
Ngoc-Son Vu, Alice Caplier