Sciweavers

150 search results - page 13 / 30
» Flipping Edges in Triangulations
Sort
View
VIP
2001
13 years 9 months ago
Facial Feature Location with Delaunay Triangulation/Voronoi Diagram Calculation
Facial features determination is essential in many applications such as personal identification, 3D face modeling and model based video coding. Fast and accurate facial feature ex...
Yi Xiao, Hong Yan
IM
2008
13 years 7 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
APVIS
2008
13 years 9 months ago
Energy-Based Hierarchical Edge Clustering of Graphs
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...
Hong Zhou, Xiaoru Yuan, Weiwei Cui, Huamin Qu, Bao...
GD
2006
Springer
13 years 11 months ago
Controllable and Progressive Edge Clustering for Large Networks
Node-link diagrams are widely used in information visualization to show relationships among data. However, when the size of data becomes very large, node-link diagrams will become ...
Huamin Qu, Hong Zhou, Yingcai Wu
BMVC
2002
13 years 10 months ago
Improving architectural 3D reconstruction by plane and edge constraining
This paper presents new techniques for improving the structural quality of automatically acquired architectural 3D models. Common architectural features like parallelism and ortho...
H. Cantzler, Robert B. Fisher, Michel Devy