🔻 Point

---

&

• (Geometry.Point = GraphTheory.Node)

Point is an abstract concept. You can't touch a point. You can't ever accurately represent a point, because a point has no dimensions. Points only have locations in Space.

Point Interpolation

• Interpolation is a type of estimation, a method of constructing (finding) new data points based on the range of a discrete set of known data points.

Voronoi Diagram

• Spacing between Sites.
• Dual with Delaunay Triangulation

Descriptions of Voronoi Cell Shape

• Platonic Shapes

  • Triangle, Square, Pentagon, Hexagon

• Angular

• Slice

• Thin

Round

Hexagonal

Voronoi Iteration

Makes the Voronoi Cells more

Delaunay Triangulation

• Decompose a plane polygon into Triangles

• Landmarking is like Markation, but only in your mind. Markum represents ViaPoints.

• https://gwlucastrig.github.io/TinfourDocs/DelaunayIntro/index.html

Target

• TargetLandMark

  • LineIn uses a TargetLandmark

• • [EKON|Reference]
  • [Point|Reference]
  • [Line|Reference]

• [Reflection.Point]

  • Direction.Geometry
  • Turn around

• [Inflection.Point]

• [Inflection.Line]

• [Flexion.Point]

• [Extension.Point]

• [Pivot.Point]

• [CenterOfMass.Point]

• To(Cache.Lokation.Point)

• [LABON:Target|Point]