Open Search
    geometryutils.h File Reference

    Classes

    class  DegeneratedInputErrorInterface
     
    class  GeometryUtilsInterface
     

    Namespaces

     maxon
     

    Enumerations

    enum class  GEOMETRY_TEST_EXACT {
      GEOM_FALSE ,
      GEOM_TRUE ,
      GEOM_PARALLEL ,
      GEOM_ANTIPARALLEL ,
      GEOM_COINCIDENT_PREV ,
      GEOM_COINCIDENT_NEXT ,
      GEOM_COINCIDENT_ALL ,
      GEOM_DEGENERATE ,
      GEOM_INVALID_INPUT
    }
     
    enum class  LOOP_OVERLAP_STATE {
      INTERSECTING ,
      DISJOINT ,
      A_INSIDE_B ,
      B_INSIDE_A ,
      COINCIDENT ,
      DEGENERATE
    }
     

    Functions

    enum maxon::GEOMETRY_TEST_EXACT MAXON_ENUM_LIST (GEOMETRY_TEST_EXACT)
     
    enum maxon::LOOP_OVERLAP_STATE MAXON_ENUM_LIST (LOOP_OVERLAP_STATE)
     

    Variables

     GEOM_FALSE
     
     GEOM_TRUE
     
     GEOM_PARALLEL
     
     GEOM_ANTIPARALLEL
     
     GEOM_COINCIDENT_PREV
     
     GEOM_COINCIDENT_NEXT
     
     GEOM_COINCIDENT_ALL
     
     GEOM_DEGENERATE
     
     GEOM_INVALID_INPUT
     
     INTERSECTING
     
     DISJOINT
     
     A_INSIDE_B
     
     B_INSIDE_A
     
     COINCIDENT
     
     DEGENERATE
     

    Variable Documentation

    ◆ GEOM_FALSE

    GEOM_FALSE

    Test result is false.

    ◆ GEOM_TRUE

    GEOM_TRUE

    Test result is true.

    ◆ GEOM_PARALLEL

    GEOM_PARALLEL

    Degenerate colinear, ordered in same direction.

    ◆ GEOM_ANTIPARALLEL

    GEOM_ANTIPARALLEL

    Degenerate colinear, ordered in opposite direction.

    ◆ GEOM_COINCIDENT_PREV

    GEOM_COINCIDENT_PREV

    Degenerate coincident points.

    ◆ GEOM_COINCIDENT_NEXT

    GEOM_COINCIDENT_NEXT

    Degenerate coincident points.

    ◆ GEOM_COINCIDENT_ALL

    GEOM_COINCIDENT_ALL

    Degenerate coincident points.

    ◆ GEOM_DEGENERATE

    GEOM_DEGENERATE

    Other degeneracy.

    ◆ GEOM_INVALID_INPUT

    GEOM_INVALID_INPUT

    < Input is non-valid in some way making it impossible to proceed

    ◆ INTERSECTING

    INTERSECTING

    Loops intersect each other. Contact points do not count as intersections, only actual crossings of the loops.

    ◆ DISJOINT

    DISJOINT

    Loops are completely disjoint from each other.

    ◆ A_INSIDE_B

    A_INSIDE_B

    A is entirely within B.

    ◆ B_INSIDE_A

    B_INSIDE_A

    B is entirely within A.

    ◆ COINCIDENT

    COINCIDENT

    Loops are coincident - they lie on each other's perimeter, e.g. A and B are the same.

    ◆ DEGENERATE

    DEGENERATE

    < At least one of A and B has insufficient vertices (need at least 3)