Full Text:   <2206>

CLC number: TP391

On-line Access: 

Received: 2006-04-03

Revision Accepted: 2006-04-17

Crosschecked: 0000-00-00

Cited: 0

Clicked: 4434

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
1. Reference List
Open peer comments

Journal of Zhejiang University SCIENCE A 2006 Vol.7 No.7 P.1233-1240

http://doi.org/10.1631/jzus.2006.A1233


Visible region extraction from a sequence of rational Bézier surfaces


Author(s):  RUAN Xiao-yu, ZHANG Hui, YONG Jun-hai

Affiliation(s):  Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China; more

Corresponding email(s):   roketruan@gmail.com, zhanghui@tsinghua.edu.cn, yongjh@mail.tsinghua.edu.cn

Key Words:  Rational Bé, zier surface, Visibility, Self-occlusion, Mutual-occlusion


RUAN Xiao-yu, ZHANG Hui, YONG Jun-hai. Visible region extraction from a sequence of rational Bézier surfaces[J]. Journal of Zhejiang University Science A, 2006, 7(7): 1233-1240.

@article{title="Visible region extraction from a sequence of rational Bézier surfaces",
author="RUAN Xiao-yu, ZHANG Hui, YONG Jun-hai",
journal="Journal of Zhejiang University Science A",
volume="7",
number="7",
pages="1233-1240",
year="2006",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2006.A1233"
}

%0 Journal Article
%T Visible region extraction from a sequence of rational Bézier surfaces
%A RUAN Xiao-yu
%A ZHANG Hui
%A YONG Jun-hai
%J Journal of Zhejiang University SCIENCE A
%V 7
%N 7
%P 1233-1240
%@ 1673-565X
%D 2006
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2006.A1233

TY - JOUR
T1 - Visible region extraction from a sequence of rational Bézier surfaces
A1 - RUAN Xiao-yu
A1 - ZHANG Hui
A1 - YONG Jun-hai
J0 - Journal of Zhejiang University Science A
VL - 7
IS - 7
SP - 1233
EP - 1240
%@ 1673-565X
Y1 - 2006
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2006.A1233


Abstract: 
A method for computing the visible regions of free-form surfaces is proposed in this paper. Our work is focused on accurately calculating the visible regions of the sequenced rational Bé;zier surfaces forming a solid model and having coincident edges but no inner-intersection among them. The proposed method calculates the silhouettes of the surfaces without tessellating them into triangle meshes commonly used in previous methods so that arbitrary precision can be obtained. The computed silhouettes of visible surfaces are projected onto a plane orthogonal to the parallel light. Then their spatial relationship is applied to calculate the boundaries of mutual-occlusion regions. As the connectivity of the surfaces on the solid model is taken into account, a surface clustering technique is also employed and the mutual-occlusion calculation is accelerated. Experimental results showed that our method is efficient and robust, and can also handle complex shapes with arbitrary precision.

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Reference

[1] Barth, W., Stürzlinger, W., 1993. Efficient ray tracing for Bézier and B-spline surfaces. Computers & Graphics, 17(4):423-430.

[2] Bentley, J.L., Ottmann, T.A., 1979. Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers, 28(9):643-647.

[3] Boehm, W., 1981. Generating the Bézier points of B-spline curves and surfaces. Computer-Aided Design, 13(16):365-366.

[4] Elber, G., Cohen, E., 1990. Hidden curve removal for free form surfaces. Computer Graphics (SIGGRAPH’90), 24(4):95-104.

[5] Elber, G., Cohen, E., 1995. Arbitrarily Precise Computation of Gauss Maps and Visibility Sets for Freeform Surfaces. Proceedings of the Third ACM Symposium on Solid Modelling and Application, p.271-279.

[6] Greene, N., Kass, M., Miller, G., 1993. Hierarchical Z-Buffer visibility. Computer Graphics (SIGGRAPH’93), 27:231-238.

[7] Hobby, J.D., 1999. Practical segment intersection with finite precision output. Computational Geometry: Theory and Applications, 13(4):199-214.

[8] Krishnan, S., Manocha, D., 2000. Partitioning trimmed spline surfaces into non-self-occluding regions for visibility Computation. Graphical Models, 62(4):283-307.

[9] Kirsanov, D., Sander, P.V., Gortler, S.J., 2003. Simple Silhouettes for Complex Surfaces. Proceedings Symposium on Geometry Processing, p.102-106.

[10] Lasser, D., 1986. Intersection of parametric surfaces in the Bernstein-Bézier representation. Computer-Aided Design, 18(4):186-192.

[11] Lu, X.S., 1998. Hidden line elimination for NURBS trimmed surface. Journal of Computer-Aided Design & Computer Graphics, 10(4):315-320 (in Chinese).

[12] Maghrabi, S.M., Griffiths, J.G., 1989. Removal of hidden lines by recursive subdivision. Computer-Aided Design, 21(9):570-576.

[13] Piegl, L., Tiller, W., 1997. The NURBS book, 2nd Ed. Springer-Verlag, New York, p.50-58.

[14] Pop, M., Huang, W., Barequest, G., Duncan, C., Goodrich, M., Kumar, S., 2001. Efficient Perspective-Accurate Silhouette Computation. ACM Computational Geometry, p.60-68.

[15] Toth, D.L., 1985. On ray tracing parametric surface. Computer Graphics (SIGGRAPH’85), 19(3):171-179.

[16] Zhang, H., Manocha, D., Hudson, T., Hoff, K.E.III, 1997. Visibility culling using hierarchical occlusion maps. Computer Graphics (SIGGRAPH’97), 31:77-88.

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - 2022 Journal of Zhejiang University-SCIENCE