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 Concept Videos

Quadric Surfaces01:28

Quadric Surfaces

Quadric surfaces are three-dimensional surfaces characterized by second-degree equations in the variables x, y, and z. These surfaces are smooth and continuous, and specific combinations of squared and linear terms define their shapes. The main types of quadric surfaces include ellipsoids, cones, paraboloids, and hyperboloids. Each type exhibits distinct geometric features depending on how the variables are arranged and related within the equation.Ellipsoids are closed surfaces formed when all...
Divergence Theorem in 3D Space01:20

Divergence Theorem in 3D Space

In vector calculus, flux measures the total flow of a vector field through a surface. For a closed surface in three-dimensional space, this means measuring how much of the field passes outward through every point on the boundary. Directly calculating this flux can be difficult when the surface has a complicated or irregular shape. The Divergence Theorem provides a powerful alternative by relating surface flux to behavior inside the enclosed region.The Divergence Theorem states that the outward...
Tangent Planes to Surfaces01:19

Tangent Planes to Surfaces

In multivariable calculus, the concept of a tangent plane plays a central role in approximating curved surfaces. When dealing with a surface defined by a function of two variables, such as z = f(x, y), the tangent plane at a given point provides the best linear approximation to the surface near that point. This local linearization allows complex, nonlinear geometries to be treated using simpler, planar models.The construction of the tangent plane involves taking vertical slices of the surface...
Tangent Planes to a Parametric Surface01:22

Tangent Planes to a Parametric Surface

A tangent plane provides a linear approximation to a curved surface at a specific point, capturing the local behavior of the surface. It can be understood as the plane that just touches the surface at that point and is defined by the tangent directions of curves lying on the surface. These tangent directions arise naturally when the surface is described parametrically, allowing systematic construction of the plane.For a surface expressed in parametric form, the position of any point is...
Parametric Surfaces01:30

Parametric Surfaces

A parametric surface in three-dimensional space is defined through a vector-valued function\begin{equation*}\mathbf{r}(u, v) = x(u, v)\mathbf{i} + y(u, v)\mathbf{j} + z(u, v)\mathbf{k}\end{equation*}where u and v are parameters within a specified domain D in the uv-plane. The functions x(u, v), y(u, v), and z(u, v) define the coordinates of points on the surface. As u and v vary over D, the position vector r(u, v) traces a continuous surface in space. This parametric representation is essential...
Tangent Planes to Level Surfaces01:31

Tangent Planes to Level Surfaces

A level surface consists of all points in space where a function of three variables takes the same fixed value. If a point lies on this surface, understanding the surface’s geometry there requires more than just knowing the point’s coordinates; it requires describing how the surface is oriented, or how it tilts, near that point.To probe this local geometry, imagine tracing a path that stays entirely on the level surface and passes through the point of interest. This path can be described as a...

You might also read

Related Articles

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

Sort by
Same author

HGNN Shield: Defending Hypergraph Neural Networks Against High-Order Structure Attack.

IEEE transactions on pattern analysis and machine intelligence·2025
Same author

Ten-year outcomes of IMRT with chemotherapy versus IMRT alone for stage II-IVa nasopharyngeal carcinoma: a retrospective study.

Discover oncology·2025
Same author

Hyper-YOLO: When Visual Object Detection Meets Hypergraph Computation.

IEEE transactions on pattern analysis and machine intelligence·2025
Same author

The pathological roles and potential mechanisms of vascular endothelial growth factor receptor-3 in gastric cancer.

The Journal of international medical research·2024
Same author

Multi-Grained Radiology Report Generation With Sentence-Level Image-Language Contrastive Learning.

IEEE transactions on medical imaging·2024
Same author

Automatic intracranial abnormality detection and localization in head CT scans by learning from free-text reports.

Cell reports. Medicine·2023

Related Experiment Video

Updated: Jun 17, 2026

Extracting Metrics for Three-dimensional Root Systems: Volume and Surface Analysis from In-soil X-ray Computed Tomography Data
09:37

Extracting Metrics for Three-dimensional Root Systems: Volume and Surface Analysis from In-soil X-ray Computed Tomography Data

Published on: April 26, 2016

A fast sweeping method for computing geodesics on triangular manifolds.

Song-Gang Xu1, Yun-Xiang Zhang, Jun-Hai Yong

  • 1Institute of Computer Graphics and Computer Aided Design Laboratory (CG&CAD), School of Software, Tsinghua University, Room 824, The Main Building, Beijing 100084, PR China. xsg06@mails.tsinghua.edu.cn

IEEE Transactions on Pattern Analysis and Machine Intelligence
|January 16, 2010
PubMed
Summary
This summary is machine-generated.

A new fast sweeping method (FSM) computes geodesics on triangular manifolds more efficiently than the fast marching method (FMM). This computational geometry advancement offers O(N) complexity for improved performance in computer graphics and intelligence.

More Related Videos

How to Measure Cortical Folding from MR Images: a Step-by-Step Tutorial to Compute Local Gyrification Index
09:57

How to Measure Cortical Folding from MR Images: a Step-by-Step Tutorial to Compute Local Gyrification Index

Published on: January 2, 2012

Three-Dimensional Cephalometric Landmark Annotation Demonstration on Human Cone Beam Computed Tomography Scans
10:23

Three-Dimensional Cephalometric Landmark Annotation Demonstration on Human Cone Beam Computed Tomography Scans

Published on: September 8, 2023

Related Experiment Videos

Last Updated: Jun 17, 2026

Extracting Metrics for Three-dimensional Root Systems: Volume and Surface Analysis from In-soil X-ray Computed Tomography Data
09:37

Extracting Metrics for Three-dimensional Root Systems: Volume and Surface Analysis from In-soil X-ray Computed Tomography Data

Published on: April 26, 2016

How to Measure Cortical Folding from MR Images: a Step-by-Step Tutorial to Compute Local Gyrification Index
09:57

How to Measure Cortical Folding from MR Images: a Step-by-Step Tutorial to Compute Local Gyrification Index

Published on: January 2, 2012

Three-Dimensional Cephalometric Landmark Annotation Demonstration on Human Cone Beam Computed Tomography Scans
10:23

Three-Dimensional Cephalometric Landmark Annotation Demonstration on Human Cone Beam Computed Tomography Scans

Published on: September 8, 2023

Area of Science:

  • Computational geometry
  • Computer graphics
  • Computer intelligence

Background:

  • Computing geodesics is crucial for applications in computer intelligence and graphics.
  • The fast marching method (FMM) is a common approach but has O(N log N) complexity.
  • Efficient geodesic computation on arbitrary triangular manifolds is needed.

Purpose of the Study:

  • To propose a novel fast sweeping method (FSM) for computing geodesics on arbitrary triangular manifolds.
  • To reduce the computational complexity compared to existing methods like FMM.
  • To ensure the accuracy and efficiency of geodesic computations.

Main Methods:

  • A fast sweeping method (FSM) is introduced, operating on undirected graphs.
  • Four specific orderings are employed to generate interfering wave groups.
  • The method traverses the graph to cover all characteristic directions.

Main Results:

  • The proposed FSM achieves a reduced computational complexity of O(N).
  • Correctness is proven through analysis of characteristic coverage.
  • Convergence and error estimation for the FSM are provided.

Conclusions:

  • The fast sweeping method (FSM) offers a more efficient alternative to the fast marching method (FMM) for geodesic computation.
  • FSM provides accurate and efficient geodesic computations on triangular manifolds.
  • This method has significant implications for computer intelligence and graphics applications.