Skip to main content
SpringerLink
Log in

A New Method for Approximating Optimal Parameterization of Polynomial Curves

  • Conference paper
Book cover Advances in Visual Computing (ISVC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4292))

Included in the following conference series:

  • 1958 Accesses

Abstract

Rational re-parameterizations of a polynomial curve that preserve the curve degree and [0,1] parameter domain are characterized by a single degree of freedom. The optimal re-parameterization in this family can be identified but the existing methods may exhibit too much residual parametric speed variation for motion control and other applications. In this paper, a new re-parameterization method to optimal parameterization is presented and the optimal parameterization in this family obtained by the new method satisfies that the maximum deviation from unit-speed is the minimum. Experiments for comparing the efficiency of this algorithm with other methods are also included.

Project supported by the National Nature Science Foundation of China (No. 60573180, No. 60533060).

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Farouki, R.T., Sakkalis, T.: Real rational curves are not “Unit Speed”. Computer Aided Geometric Design 8, 151–157 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Zhang, C., Cheng, F., Miura, K.: A method for determining knots in parametric curve interpolation. CAGD 15, 399–416 (1998)

    MATH  MathSciNet  Google Scholar 

  3. Farouki, R.T.: Convergent inversion approximations for polynomials in Bernstein form. Computer Aided Geometric Design 17, 179–196 (2000)

    Article  MathSciNet  Google Scholar 

  4. Tsai, Y.-F., Farouki, R.T., Feldman, B.: Perfomance analysis of CNC interpolators for time-dependent federates along PH curves. Computer Aided Geometric Design 18, 245–265 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Wang, F.C., Wright, P.K.: Open architecture controllers for machine tools, Part2:A real time quintic spline interpolator. ASME J. Manufacturing Science and Engineering 120, 425–432 (1998)

    Article  Google Scholar 

  6. Wang, F.C., Wright, P.K., Barsky, B.A., Yang, D.C.H.: Approximately arc-length parameterized C3 quintic interpolatory splines. ASME J. Mech. Design 121, 430–439 (1999)

    Article  Google Scholar 

  7. Zhang, C., Han, H., Cheng, F.: Determining Knots by Minimizing Energy. Journal of Computer Science and Technology 21(6), 261–264 (2006)

    Article  MATH  Google Scholar 

  8. Farouki, R.T.: Optimal parameterizations. Computer Aided Geometric Design 14, 153–168 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  9. Costantini, P., Farouki, R.T., Manni, C., Sestini, A.: Computation of optimal composite re-parameterizations. Computer Aided Geometric Design 18, 875–897 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hermann, J.W.: A genetic algorithm for minimax optimization Technical Report, TR 97-61, USA: The Institute for Systems Research, University of Maryland, pp. 1–15 (1997)

    Google Scholar 

  11. Hermann, J.W.: A genetic algorithm for minimax optimization problems. In: Proc. 1999 Congress on Evolutionary Computation, Washington, D.C., pp. 1099–1103 (1999)

    Google Scholar 

  12. Jesen, M.T.: Robust and flexible scheduling with evolutionary computation. PhD Dissertation, University of Aarhus, Denmark pp. 21–32 (2001)

    Google Scholar 

  13. Jesen, M.T.: A new look at soving minimax problems with coevolution. In: 4th Metaheuristics International Conference, Porto, Portugal, pp. 103–107 (2001)

    Google Scholar 

  14. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proc. IEEE Int. Conf. on Neural Networks, Perth, WA, Australia, pp. 1942–1948 (1995)

    Google Scholar 

  15. Eberhart, R.C., Shi, Y.: Particle swarm optimization: developments, applications and resources. In: Proc. 2001 Congress on Evolutionary, Seoul, South Korea, pp. 81–86 (2001)

    Google Scholar 

  16. Jing, K., Jixin, Q., Yizheng, Q.: Particle Swarm Optimization Method for Solving Continuous Minimax Problems. Chinese Journal of Scientific Instrument 26(3), 267–271 (2005) (in Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Shandong University, 250061, Jinan, P.R. China

    Fenghua Guo & Caiming Zhang

  2. School of Computer Science and Technology, Shandong Ecnomic University, 250014, Jinan, P.R. China

    Caiming Zhang

Authors
  1. Fenghua Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Caiming Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Nevada, Reno, USA

    George Bebis

  2. NASA Ames Research Center, Moffett Field, CA, USA

    Richard Boyle

  3. Lawrence Berkeley National Laboratory, Berkeley, CA, USA

    Bahram Parvin

  4. Desert Research Institute, Reno, NV, USA

    Darko Koracin

  5. Digital Image Research Center, Kingston University, London, UK

    Paolo Remagnino

  6. Intel, 95052, Santa Clara, CA, USA

    Ara Nefian

  7. University of California, 430, Computer Science Building, 92697-3425, Irvine, CA, USA

    Gopi Meenakshisundaram

  8. Institute for Data Analysis and Visualization, P.O. Box

    Valerio Pascucci

  9. Department of Computer Science and Engineering, Czech Technical University in Prague, Czech

    Jiri Zara

  10. Rockwell Scientific, 1049 Camino Dos Rios, 91360, Thousand Oaks, CA, USA

    Jose Molineros

  11. Computer Graphics Group, Bielefeld University, D-33501, Bielefeld, Germany

    Holger Theisel

  12. Hewlett Packard Labs, Palo Alto, CA, USA

    Tom Malzbender

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guo, F., Zhang, C. (2006). A New Method for Approximating Optimal Parameterization of Polynomial Curves. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2006. Lecture Notes in Computer Science, vol 4292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919629_11

Download citation

  • DOI: https://doi.org/10.1007/11919629_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48626-8

  • Online ISBN: 978-3-540-48627-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation