On Triangulations of a Set of Points in the Plane
A set, V, of points in the plane is triangulated by a subset, T, of the straight line segments whose enpoints are in V, if T is a maximal subset such that the line segments in T intersect only at their endpoints. The weight of any triangulation is the sum of the Euclidean lengths of the line segment...
Main Author: | |
---|---|
Other Authors: | |
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/148916 |