Search For:

Displaying 1-11 out of 11 total
Isotropic Mesh Simplification by Evolving the Geodesic Delaunay Triangulation
Found in: International Symposium on Voronoi Diagrams in Science and Engineering
By Shi-Qing Xin, Shuang-Min Chen, Ying He, Guo-Jin Wang, Xianfeng Gu, Hong Qin
Issue Date:June 2011
pp. 39-47
In this paper, we present an intrinsic algorithm for isotropic mesh simplification. Starting with a set of unevenly distributed samples on the surface, our method computes the geodesic Delaunay triangulation with regard to the sample set and iteratively ev...
 
Interactive Applications for Sketch-Based Editable Polycube Map
Found in: IEEE Transactions on Visualization and Computer Graphics
By I. Garcia, Jiazhi Xia, Ying He, Shi-Qing Xin,G. Patow
Issue Date:July 2013
pp. 1158-1171
In this paper, we propose a sketch-based editable polycube mapping method that, given a general mesh and a simple polycube that coarsely resembles the shape of the object, plus sketched features indicating relevant correspondences between the two, provides...
 
An Intrinsic Algorithm for Parallel Poisson Disk Sampling on Arbitrary Surfaces
Found in: IEEE Transactions on Visualization and Computer Graphics
By Xiang Ying, Shi-Qing Xin, Qian Sun, Ying He
Issue Date:September 2013
pp. 1425-1437
Poisson disk sampling has excellent spatial and spectral properties, and plays an important role in a variety of visual computing. Although many promising algorithms have been proposed for multidimensional sampling in euclidean space, very few studies have...
 
LAACAD: Load Balancing k-Area Coverage through Autonomous Deployment in Wireless Sensor Networks
Found in: 2012 IEEE 32nd International Conference on Distributed Computing Systems (ICDCS)
By Feng Li,Jun Luo,Shi-Qing Xin,Wen-Ping Wang,Ying He
Issue Date:June 2012
pp. 566-575
Although the problem of k-area coverage has been intensively investigated for dense wireless sensor networks (WSNs), how to arrive at a k-coverage sensor deployment that optimizes certain objectives in relatively sparse WSNs still faces both theoretical an...
 
Efficiently Computing Exact Geodesic Loops within Finite Steps
Found in: IEEE Transactions on Visualization and Computer Graphics
By Shi-Qing Xin,Ying He,Chi-Wing Fu
Issue Date:June 2012
pp. 879-889
Closed geodesics, or geodesic loops, are crucial to the study of differential topology and differential geometry. Although the existence and properties of closed geodesics on smooth surfaces have been widely studied in mathematics community, relatively lit...
 
Parallel chen-han (PCH) algorithm for discrete geodesics
Found in: ACM Transactions on Graphics (TOG)
By Shi-Qing Xin, Xiang Ying, Ying He
Issue Date:January 2014
pp. 1-11
In many graphics applications, the computation of exact geodesic distance is very important. However, the high computational cost of existing geodesic algorithms means that they are not practical for large-scale models or time-critical applications. To tac...
     
A global algorithm to compute defect-tolerant geodesic distance
Found in: SIGGRAPH Asia 2012 Technical Briefs (SA '12)
By Dao T. P. Quynh, Shi-Qing Xin, Xiang Ying, Ying He
Issue Date:November 2012
pp. 1-4
Computing geodesic distance on surfaces plays a critical role in digital geometry processing. However, due to its locally shortest nature, geodesic distance is highly sensitive to local geometrical and topological changes, diminishing its applications to r...
     
Constant-time all-pairs geodesic distance query on triangle meshes
Found in: Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games (I3D '12)
By Shi-Qing Xin, Xiang Ying, Ying He
Issue Date:March 2012
pp. 31-38
Computing discrete geodesics on polyhedral surfaces plays an important role in computer graphics. In contrast to the well-studied "single-source, all-destination" discrete geodesic problem, little progress has been reported to the all-pairs geodesic, i.e.,...
     
Constant-time O(1) all pairs geodesic distance query on triangle meshes
Found in: SIGGRAPH Asia 2011 Sketches (SA '11)
By Shi-Qing Xin, Xiang Ying, Ying He
Issue Date:December 2011
pp. 1-2
Geodesic plays an important role in geometric computation and analysis. Rather than the widely studied single source all destination discrete geodesic problem, very little work has been reported on the all pairs geodesic distance query So far, the best kno...
     
Parallel and accurate Poisson disk sampling on arbitrary surfaces
Found in: SIGGRAPH Asia 2011 Sketches (SA '11)
By Qian Sun, Shi-Qing Xin, Ying He, Ying Xiang
Issue Date:December 2011
pp. 1-2
Sampling plays an important role in a variety of graphics applications. Among existing sampling methods, Poisson disk sampling is popular thanks to its useful statistical property in distribution and the absence of aliasing artifacts. Although many promisi...
     
Improving Chen and Han's algorithm on the discrete geodesic problem
Found in: ACM Transactions on Graphics (TOG)
By Guo-Jin Wang, Shi-Qing Xin
Issue Date:August 2009
pp. 1-8
The computation of geodesic distances or paths between two points on triangulated meshes is a common operation in many computer graphics applications. In this article, we present an exact algorithm for the single-source all-vertices shortest path problem. ...
     
 1