Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Solution of the discrete Plateau problem.

T C Hu1, A B Kahng, G Robins

  • 1Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA 92093-0114, USA.

Proceedings of the National Academy of Sciences of the United States of America
|October 1, 1992
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Improving network approaches to the study of complex social-ecological interdependencies.

Nature sustainability·2022
Same author

Photoinduced multistage phase transitions in Ta<sub>2</sub>NiSe<sub>5</sub>.

Nature communications·2021
Same author

Tuneable dielectric and optical characteristics of tailor-made inorganic electro-chromic materials.

Scientific reports·2017
Same author

Association of a let-7 KRAS rs712 polymorphism with the risk of breast cancer.

Genetics and molecular research : GMR·2015
Same author

Time is of the essence: an application of a relational event model for animal social networks.

Behavioral ecology and sociobiology·2015
Same author

International variation in Helicobacter pylori infection and rates of oesophageal cancer.

European journal of cancer (Oxford, England : 1990)·2008

Researchers developed a novel network-flow algorithm to solve a discrete version of the Plateau problem. This method finds minimal surfaces by calculating minimal slabs and reducing their thickness to zero.

Area of Science:

  • Computational geometry
  • Applied mathematics
  • Computer vision

Background:

  • The Plateau problem seeks minimal surfaces bounded by a given curve.
  • Finding discrete solutions for minimal surfaces is computationally challenging.
  • Existing methods may struggle with complex boundary curves or computational efficiency.

Purpose of the Study:

  • To present a novel discrete algorithm for solving the Plateau problem.
  • To utilize a network-flow formulation for minimal surface computation.
  • To achieve accurate minimal surface approximation by adapting slab thickness.

Main Methods:

  • A network-flow formulation is employed to identify minimal "slabs" of a specific thickness.
  • The algorithm iteratively refines these slabs.

Related Experiment Videos

  • The slab thickness is systematically reduced to approximate a zero-thickness minimal surface.

    • Main Results:

    • The algorithm successfully computes discrete minimal surfaces for given boundary curves.
    • The network-flow approach provides an efficient method for finding these surfaces.
    • The results demonstrate the efficacy of the slab-thickness reduction technique.

    Conclusions:

    • The developed algorithm offers an effective discrete solution to the Plateau problem.
    • Network-flow provides a robust framework for minimal surface computation.
    • This approach advances the field of discrete differential geometry and its applications.