Skip to main content
Journal Article

The Plateau-Bézier problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2768 262-273
DOI: 10.1007/978-3-540-39422-8_18
35Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study the Plateau problem restricted to polynomial surfaces using techniques coming from the theory of Computer Aided Geometric Design. The results can be used to obtain polynomial approximations to minimal surfaces. The relationship between harmonic Bézier surfaces and minimal surfaces with free boundaries is shown. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Monterde, J. (2003). The Plateau-Bézier problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2768, 262–273. https://doi.org/10.1007/978-3-540-39422-8_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free