Options
All
  • Public
  • Public/Protected
  • All
Menu

Class ShamosHoey

Shamos-Hoey simple polygon detection

Based upon C++ implementation:

http://geomalgorithms.com/a09-_intersect-3.html

C++ implementation license:

Copyright 2001 softSurfer, 2012 Dan Sunday This code may be freely used and modified for any purpose providing that this copyright notice is included with it. SoftSurfer makes no warranty for this code, and cannot be held liable for any real or imagined damage resulting from its use. Users of this code must verify correctness for their application.

Hierarchy

  • ShamosHoey

Index

Methods

Static simplePolygon

  • simplePolygon(polygon: Polygon): boolean

Static simplePolygonLineString

  • simplePolygonLineString(ring: LineString): boolean
  • Determine if the polygon line string ring is simple

    Parameters

    Returns boolean

    true if simple, false if intersects

Static simplePolygonLineStrings

  • simplePolygonLineStrings(rings: Array<LineString>): boolean

Static simplePolygonPoints

  • simplePolygonPoints(points: Array<Point>): boolean
  • Determine if the polygon points are simple

    Parameters

    • points: Array<Point>

      polygon as points

    Returns boolean

    true if simple, false if intersects

Static simplePolygonRingPoints

  • simplePolygonRingPoints(pointRings: Array<Array<Point>>): boolean
  • Determine if the polygon point rings are simple

    Parameters

    • pointRings: Array<Array<Point>>

      polygon point rings

    Returns boolean

    true if simple, false if intersects

Generated using TypeDoc