版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Ind Technol Res Inst Hsinchu Taiwan Natl Tsing Hua Univ Hsinchu Taiwan Natl Taiwan Univ Taipei Taiwan
出 版 物:《COMPUTER GRAPHICS FORUM》 (计算机图形学论坛)
年 卷 期:2011年第30卷第7期
页 面:2003-2010页
核心收录:
学科分类:08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术(可授工学、理学学位)]
主 题:BIPARTITE graphs VORONOI polygons COMPUTER graphics TOPOLOGY GEOMETRY
摘 要:In this paper, we propose bipartite polar classification to augment an input unorganized point set P with two disjoint groups of points distributed around the ambient space of P to assist the task of surface reconstruction. The goal of bipartite polar classification is to obtain a space partitioning of P by assigning pairs of Voronoi poles into two mutually invisible sets lying in the opposite sides of P through direct point set visibility examination. Based on the observation that a pair of Voronoi poles are mutually invisible, spatial classification is accomplished by carving away visible exterior poles with their counterparts simultaneously determined as interior ones. By examining the conflicts of mutual invisibility, holes or boundaries can also be effectively detected, resulting in a hole-aware space carving technique. With the classified poles, the task of surface reconstruction can be facilitated by more robust surface normal estimation with global consistent orientation and off-surface point specification for variational implicit surface reconstruction. We demonstrate the ability of the bipartite polar classification to achieve robust and efficient space carving on unorganized point clouds with holes and complex to pology and show its application to surface reconstruction.