Sciweavers

942 search results - page 114 / 189
» Constraints in Graph Drawing Algorithms
Sort
View
CVPR
2007
IEEE
14 years 4 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
CORR
2006
Springer
93views Education» more  CORR 2006»
13 years 10 months ago
Multirobot rendezvous with visibility sensors in nonconvex environments
This paper presents a coordination algorithm for mobile autonomous robots. Relying upon distributed sensing, the robots achieve rendezvous, that is, they move to a common location....
Anurag Ganguli, Jorge Cortés, Francesco Bul...
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
14 years 4 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
CGF
2010
126views more  CGF 2010»
13 years 10 months ago
Contour-based Interface for Refining Volume Segmentation
Medical volume images contain ambiguous and low-contrast boundaries around which existing fully- or semiautomatic segmentation algorithms often cause errors. In this paper, we pro...
Takashi Ijiri, Hideo Yokota
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 2 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...