Skip to main content
SpringerLink
Log in

Simulated Annealing Genetic Algorithm for Surface Intersection

  • Conference paper
Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Included in the following conference series:

Abstract

The paper integrated genetic algorithm and marching method into a novel algorithm to solve the surface intersection problem. By combining genetic algorithm with local searching method the efficiency of evolution is greatly improved. By fully utilizing the global searching ability and instinct attribute for parallel computation of genetic algorithm and the local rapid convergence of marching method, the algorithm can compute the intersection robustly and generate correct topology of intersection curves. The details of the new algorithm are discussed here. The algorithm have been implemented in a prototype system named TigerSurf based on Windows/NT platform, and a soundly result is gotten from test datum.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Granine, T.A., Klein IV, F.W.: A new approach to the surface intersection problem. Computer Aided Geometric Design 14, 111–134 (1997)

    Article  MathSciNet  Google Scholar 

  2. David, G.: Genetic Algorithms for Search, Optimization and Machine Learning. Addison-Wesley, NY (1988)

    Google Scholar 

  3. Jacq, J.-J., Roux, C.: Registration of 3D images by genetic optimization. Pattern Recognition 16(8), 823–856 (1995)

    Article  Google Scholar 

  4. Cross, A., Hancock, E.: Genetic search for structural matching. In: Buxton, B.F., Cipolla, R. (eds.) ECCV 1996. LNCS, vol. 1064, pp. 514–525. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  5. Brunstrom, K., Stoddart, A.J.: Genetic algorithms for free-form surface matching, Technical Report ISRN KTH/NA/P–95/19—SE, Dept. Of Numerical Analysis and Computing Science, KTH(Royal Institute of Technology) (October 1995)

    Google Scholar 

  6. Wu, S.T., Andrade, L.N.: Marching along a regular surface/surface intersection with circular steps. Computer Aided Geometric Design 16, 249–268 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Mullenheim, G.: On determining start points for a surface/surface intersection algorithm. Computer Aided Geometric Design 8, 401–408 (1991)

    Article  MathSciNet  Google Scholar 

  8. Farouki, R.T., Hass, J., Sederberg, T.W.: Linear perturbation methods for topologically-consistent representation of free-form surface intersections, NSF/DARPA CARGO Project Report (May 2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of CAD&CG, Zhejiang University, Hangzhou, 310027, China

    Min Tang & Jin-xiang Dong

Authors
  1. Min Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin-xiang Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electrical and Electronic Engineering, Nanyang Technological University, Block S1, Nanyang Avenue, 639798, Singapore

    Lipo Wang

  2. School of Software, Sun Yat-Sen University, 510275, Guangzhou, China

    Ke Chen

  3. School of Computer Engineering, Nanyang Technological University, BLK N4, 2b-39, Nanyang Avenue, 639798, Singapore

    Yew Soon Ong

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tang, M., Dong, Jx. (2005). Simulated Annealing Genetic Algorithm for Surface Intersection. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_6

Download citation

  • DOI: https://doi.org/10.1007/11539902_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

  • Online ISBN: 978-3-540-31863-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation