hgeometry-0.14: Geometric Algorithms, Data structures, and Data types.
Copyright(C) Frank Staals
Licensesee the LICENSE file
MaintainerFrank Staals
Safe HaskellNone
LanguageHaskell2010

Algorithms.Geometry.PolygonTriangulation.Types

Description

 
Synopsis

Documentation

constructSubdivision Source #

Arguments

:: forall s r p. (Fractional r, Ord r) 
=> LineSegment 2 p r

A counter-clockwise edge along the outer boundary

-> [LineSegment 2 p r]

remaining original edges

-> [LineSegment 2 p r]

diagonals

-> PlanarSubdivision s p PolygonEdgeType PolygonFaceData r 

Given a list of original edges and a list of diagonals, creates a planar-subdivision

running time: \(O(n\log n)\)

constructGraph Source #

Arguments

:: forall s r p. (Fractional r, Ord r) 
=> LineSegment 2 p r

A counter-clockwise edge along the outer boundary

-> [LineSegment 2 p r]

remaining original edges

-> [LineSegment 2 p r]

diagonals

-> PlaneGraph s p PolygonEdgeType PolygonFaceData r 

Given a list of original edges and a list of diagonals, creates a planar-subdivision

running time: \(O(n\log n)\)