Abstract
We present an A* search algorithm that extracts feature curves from 3D meshes. A* algorithm, which finds shortest path on a weighted graph using heuristic, is extended to extract a set of feature curves defined by a curvature-based weighting function. The extracted curve that minimizes the defined feature weight is further smoothed using a smoothing algorithm we present. Our scheme shows very robust and efficient feature extraction results on various 3D meshes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrew, S.: Interactive generation of feature curves on surfaces: A minimal path approach, Master’s thesis, Dept. of Computer Science, University of Toronto (2000)
Gumhold, S., Wang, X., McLeod, R.: Feature extraction from point clouds. In: 10th International Meshing Roundtable 2001, pp. 293–305 (2001)
Hubeli, A., Gross, M.: Multiresolutional feature extraction from unstructured meshes. In: IEEE Visualization 2001, pp. 287–294 (2001)
Jung, M., Kim, H.: Snaking across 3d meshes. In: Pacific Graphics 2004, pp. 415–420 (2004)
Kim, S.-K., Kim, C.-H.: Finding ridges and valleys in a discrete surface using a modified MLS approximation. Computer-Aided Design 38(2), 173–180 (2006)
Lee, Y., Lee, S.: Geometric snakes for triangular meshes. Computer Graphics Forum 21(3), 229–238 (2002)
Martinez, D., Velho, L., Carvalho, P.: Computing geodesics on triangular meshes. Computers & Graphics 29(5), 667–675 (2005)
Milroy, M., Bradley, C., Vickers, G.: Segmentation of a wrap-around model using an active contour. Computer-Aided Design 29(4), 299–320 (1997)
Min, K., Metaxas, D., Jung, M.-R.: Active Contours with Level-Set for Extracting Feature Curves from Triangular Meshes. In: Nishita, T., Peng, Q., Seidel, H.-P. (eds.) CGI 2006. LNCS, vol. 4035, pp. 185–196. Springer, Heidelberg (2006)
Min, K.: Estimating Principal Properties on Triangular Meshes. In: Lee, G., Howard, D., Ślęzak, D. (eds.) ICHIT 2011. LNCS, vol. 6935, pp. 614–621. Springer, Heidelberg (2011)
Ohtake, Y., Belyaev, A., Seidel, H.-P.: Ridge-valley lines on meshes via implicit surface fitting. ACM Transactions on Graphics 23(3), 609–612 (2004)
Pauly, M., Keiser, R., Gross, M.: Multi-scale feature extraction on point-sampled surfaces. Computer Graphics Forum 22(3), 281–289 (2003)
Rossl, C., Kobbelt, L., Seidel, H.-P.: Extraction of feature lines on triangulated surfaces using morphological operators. In: Smart Graphics, AAAI Spring Symposium 2000, pp. 71–75 (2000)
Stylianou, G., Falin, G.: Crest lines for surface segmentation and flattening. IEEE Transactions on Visualization and Computer Graphics 10(5), 536–544 (2004)
Surazhsky, V., Surazhsky, T., Kirsanov, D., Gortler, S., Hoppe, H.: Fast exact and approximate geodesics on meshes. ACM Trans. on Graphics 24(3), 553–560 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Min, K. (2012). An A* Algorithm for Extracting Feature Curves from 3D Meshes. In: Lee, G., Howard, D., Ślęzak, D., Hong, Y.S. (eds) Convergence and Hybrid Information Technology. ICHIT 2012. Communications in Computer and Information Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32692-9_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-32692-9_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32691-2
Online ISBN: 978-3-642-32692-9
eBook Packages: Computer ScienceComputer Science (R0)