Efficient 3D region guarding for multimedia data processing

With the advance of scanning devices, 3-d geometric models have been captured and widely used in animation, video, interactive virtual environment design nowadays. Their effective analysis, integration, and retrieval are important research topics in multimedia. This paper studies a geometric modeling problem called 3D region guarding. The 3D region guarding is a well known NP-hard problem; we present an efficient hierarchical integer linear programming (HILP) optimization algorithm to solve it on massive data sets. We show the effectiveness of our algorithm and briefly illustrate its applications in multimedia data processing and computer graphics such as shape analysis and retrieval, and morphing animation.

[1]  Godfried T. Toussaint,et al.  An Efficient Algorithm for Decomposing a Polygon into Star-Shaped Polygons , 1981 .

[2]  Deborah Silver,et al.  Curve-Skeleton Properties, Applications, and Algorithms , 2007, IEEE Trans. Vis. Comput. Graph..

[3]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[4]  Zhengrong Liang,et al.  Reliable Path for Virtual Endoscopy: Ensuring Complete Examination of Human Organs , 2001, IEEE Trans. Vis. Comput. Graph..

[5]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[6]  Ioannis Pratikakis,et al.  3D Mesh Segmentation Methodologies for CAD applications , 2007 .

[7]  Daniel Cohen-Or,et al.  Consensus Skeleton for Non‐rigid Space‐time Registration , 2010, Comput. Graph. Forum.

[8]  Ari Rappoport,et al.  Shape blending using the star-skeleton representation , 1995, IEEE Computer Graphics and Applications.

[9]  Ariel Shamir,et al.  A survey on Mesh Segmentation Techniques , 2008, Comput. Graph. Forum.

[10]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[11]  Joseph S. B. Mitchell,et al.  A constant-factor approximation algorithm for optimal terrain guarding , 2005, SODA '05.

[12]  P. Erdös,et al.  A combinatorial theorem , 1950 .

[13]  Jyh-Ming Lien,et al.  Eurographics Symposium on Point-based Graphics (2007) Approximate Star-shaped Decomposition of Point Set Data , 2022 .

[14]  Sariel Har-Peled,et al.  Guarding galleries and terrains , 2002, Inf. Process. Lett..

[15]  Hans-Dietrich Hecker,et al.  Two NP-Hard Art-Gallery Problems for Ortho-Polygons , 1995, Math. Log. Q..

[16]  Hong Qin,et al.  Surface Mapping Using Consistent Pants Decomposition , 2009, IEEE Transactions on Visualization and Computer Graphics.

[17]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[18]  Joseph O'Rourke,et al.  Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[19]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[20]  Xin Li,et al.  A non-rigid registration algorithm for compatible skeletonization , 2010, 2010 5th International Conference on Computer Science & Education.

[21]  Hong Qin,et al.  Globally Optimal Surface Mapping for Surfaces with Arbitrary Topology , 2008, IEEE Transactions on Visualization and Computer Graphics.

[22]  Matthew J. Katz,et al.  On guarding the vertices of rectilinear domains , 2008, Comput. Geom..

[23]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.