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

Adjusting a Traverse01:12

Adjusting a Traverse

219
In the site survey of a four-sided traverse, internal angles are essential to ensure geometric accuracy. The survey revealed that the sum of the measured internal angles was 359 degrees and 48 minutes, which is 12 minutes less than the expected 360 degrees. This discrepancy signals an error likely arising from measurement inaccuracies during the fieldwork.To rectify this error, the adjustment process involved distributing the 12-minute shortfall equally across the four internal angles. By...
219
Design Example: Traverse Angle Computations01:25

Design Example: Traverse Angle Computations

189
Traverse angle computations are a critical component of surveying, used to compute the internal angles within a closed traverse. A traverse consists of a series of connected lines forming a closed loop, often used for land boundary delineation or mapping. Calculating the internal angles ensures accuracy in the traverse geometry and is essential for checking survey data integrity.The process begins with known azimuths and bearings of the traverse sides. Internal angles at each vertex are...
189
Areas Within Irregular Boundaries01:26

Areas Within Irregular Boundaries

181
Calculating areas within irregular boundaries, such as along rivers or curved roads, is crucial in various fields, including surveying, engineering, and environmental management. Surveyors often begin by creating a traverse, a connected series of straight lines approximating the area's boundary. The coordinates of each traverse point are essential for calculating the enclosed area. The double meridian distance formula is a widely used technique for this purpose. This method utilizes the...
181
Curvilinear Motion: Rectangular Components01:23

Curvilinear Motion: Rectangular Components

843
Curvilinear motion characterizes the movement of a particle or object along a curved path, notably evident when envisioning a car navigating a winding road. If the car starts at point A, its position vector is established within a fixed frame of reference, where the ratio of the position vector to its magnitude signifies the unit vector pointing in the position vector's direction.
As the car advances, its position evolves over time. Quantifying the car's velocity involves computing the...
843
Field Procedure for Staking Out Curves01:26

Field Procedure for Staking Out Curves

252
Staking out curves is an essential process in construction to ensure the accurate alignment of structures along a curved path. This task involves positioning stakes at calculated locations corresponding to the curve's design, effectively translating plans into physical markers in the field. The process begins by determining the geometric parameters of the curve, including the radius, central angle, and tangent distances. These parameters are critical for identifying key points such as the...
252
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

190
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
190

You might also read

Related Articles

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

Sort by
Same author

Editorial for the Special Issue on "Geometry Reconstruction from Images".

Journal of imaging·2024
Same author

Scalable Mesh Refinement for Canonical Polygonal Schemas of Extremely High Genus Shapes.

IEEE transactions on visualization and computer graphics·2020
Same author

Reconstructing the Curve-Skeletons of 3D Shapes Using the Visual Hull.

IEEE transactions on visualization and computer graphics·2012
Same author

Sharpen&Bend: recovering curved sharp edges in triangle meshes produced by feature-insensitive sampling.

IEEE transactions on visualization and computer graphics·2005

Related Experiment Video

Updated: Nov 10, 2025

Automatic Laser-based Geometry Capture for Finite Element Analysis of Weld Beads
07:58

Automatic Laser-based Geometry Capture for Finite Element Analysis of Weld Beads

Published on: July 25, 2025

390

Deterministic Linear Time Constrained Triangulation Using Simplified Earcut.

Marco Livesu, Gianmarco Cherchi, Riccardo Scateni

    IEEE Transactions on Visualization and Computer Graphics
    |March 31, 2021
    PubMed
    Summary

    This study introduces an optimal, linear-time algorithm for segment triangulation. It proves that polygons generated during triangulation can be efficiently processed using an earcut method, simplifying implementation and ensuring convergence.

    More Related Videos

    Author Spotlight: Integrating Ultrasound Imaging with Biochemical Markers for Thyroid Disease Diagnosis
    05:41

    Author Spotlight: Integrating Ultrasound Imaging with Biochemical Markers for Thyroid Disease Diagnosis

    Published on: February 9, 2024

    839
    Robotized Testing of Camera Positions to Determine Ideal Configuration for Stereo 3D Visualization of Open-Heart Surgery
    05:12

    Robotized Testing of Camera Positions to Determine Ideal Configuration for Stereo 3D Visualization of Open-Heart Surgery

    Published on: August 12, 2021

    2.3K

    Related Experiment Videos

    Last Updated: Nov 10, 2025

    Automatic Laser-based Geometry Capture for Finite Element Analysis of Weld Beads
    07:58

    Automatic Laser-based Geometry Capture for Finite Element Analysis of Weld Beads

    Published on: July 25, 2025

    390
    Author Spotlight: Integrating Ultrasound Imaging with Biochemical Markers for Thyroid Disease Diagnosis
    05:41

    Author Spotlight: Integrating Ultrasound Imaging with Biochemical Markers for Thyroid Disease Diagnosis

    Published on: February 9, 2024

    839
    Robotized Testing of Camera Positions to Determine Ideal Configuration for Stereo 3D Visualization of Open-Heart Surgery
    05:12

    Robotized Testing of Camera Positions to Determine Ideal Configuration for Stereo 3D Visualization of Open-Heart Surgery

    Published on: August 12, 2021

    2.3K

    Area of Science:

    • Computational Geometry
    • Computer Graphics
    • Algorithm Design

    Background:

    • Triangulation algorithms typically insert points then segments.
    • Segment insertion involves deleting intersected triangles and refilling the resulting hole with two polygons.
    • Existing methods can be complex and computationally intensive.

    Purpose of the Study:

    • To present a novel, efficient triangulation algorithm for non-intersecting input segments.
    • To demonstrate the theoretical correctness and practical applicability of the proposed method.
    • To establish a new standard for optimal deterministic linear-time triangulation.

    Main Methods:

    • The algorithm inserts segments by deleting intersected triangles and creating two new polygons.
    • It leverages the property that these polygons have convex vertices suitable for an earcut triangulation.
    • The method guarantees convergence by exploiting the guaranteed existence of valid ears in simple polygons.

    Main Results:

    • A proof is provided that polygons generated during segment insertion can be triangulated using an earcut approach.
    • This leads to an optimal deterministic algorithm with linear time complexity.
    • The algorithm is shown to be simple to implement and validated through practical applications.

    Conclusions:

    • The proposed earcut-based triangulation method offers a significant improvement in efficiency and simplicity.
    • It provides a correct and robust solution for triangulating polygons generated during segment insertion.
    • This work advances the field of computational geometry with a practically relevant and theoretically sound algorithm.