hasufell/cga
1
1
Fork 0
Code Issues Pull Requests Releases Wiki Activity

ALGO: fix spelling

Browse Source
This commit is contained in:
hasufell 2015-01-07 19:15:51 +01:00
parent 013dfd054b
commit 2bc3aec80a
No known key found for this signature in database
GPG Key ID: 220CD1C5BDEED020
1 changed files with 15 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
Algorithms/PolygonTriangulation.hs
View File

@ -41,51 +41,51 @@ classify prev v next
| otherwise = (v, VRegular) | otherwise = (v, VRegular)
-- |Whether the vertex, given it's next and previous vertex -- |Whether the vertex, given it's next and previous vertex,
-- is a start vertex. -- is a start vertex.
isVStart :: PT -- ^ previous vertice isVStart :: PT -- ^ previous vertex
-> PT -- ^ vertice to check -> PT -- ^ vertice to check
-> PT -- ^ next vertice -> PT -- ^ next vertex
-> Bool -> Bool
isVStart prev v next = isVStart prev v next =
(ptCmpY next v == LT) && (ptCmpY prev v == LT) && (cw next v prev) (ptCmpY next v == LT) && (ptCmpY prev v == LT) && (cw next v prev)
-- |Whether the vertex, given it's next and previous vertex -- |Whether the vertex, given it's next and previous vertex,
-- is a split vertex. -- is a split vertex.
isVSplit :: PT -- ^ previous vertice isVSplit :: PT -- ^ previous vertex
-> PT -- ^ vertice to check -> PT -- ^ vertice to check
-> PT -- ^ next vertice -> PT -- ^ next vertex
-> Bool -> Bool
isVSplit prev v next = isVSplit prev v next =
(ptCmpY prev v == LT) && (ptCmpY next v == LT) && (cw prev v next) (ptCmpY prev v == LT) && (ptCmpY next v == LT) && (cw prev v next)
-- |Whether the vertex, given it's next and previous vertex -- |Whether the vertex, given it's next and previous vertex,
-- is an end vertex. -- is an end vertex.
isVEnd :: PT -- ^ previous vertice isVEnd :: PT -- ^ previous vertex
-> PT -- ^ vertice to check -> PT -- ^ vertice to check
-> PT -- ^ next vertice -> PT -- ^ next vertex
-> Bool -> Bool
isVEnd prev v next = isVEnd prev v next =
(ptCmpY prev v == GT) && (ptCmpY next v == GT) && (cw next v prev) (ptCmpY prev v == GT) && (ptCmpY next v == GT) && (cw next v prev)
-- |Whether the vertex, given it's next and previous vertex -- |Whether the vertex, given it's next and previous vertex,
-- is a merge vertex. -- is a merge vertex.
isVMerge :: PT -- ^ previous vertice isVMerge :: PT -- ^ previous vertex
-> PT -- ^ vertice to check -> PT -- ^ vertice to check
-> PT -- ^ next vertice -> PT -- ^ next vertex
-> Bool -> Bool
isVMerge prev v next = isVMerge prev v next =
(ptCmpY next v == GT) && (ptCmpY prev v == GT) && (cw prev v next) (ptCmpY next v == GT) && (ptCmpY prev v == GT) && (cw prev v next)
-- |Whether the vertex, given it's next and previous vertex -- |Whether the vertex, given it's next and previous vertex,
-- is a regular vertex. -- is a regular vertex.
isVRegular :: PT -- ^ previous vertice isVRegular :: PT -- ^ previous vertex
-> PT -- ^ vertice to check -> PT -- ^ vertice to check
-> PT -- ^ next vertice -> PT -- ^ next vertex
-> Bool -> Bool
isVRegular prev v next = isVRegular prev v next =
(not . isVStart prev v $ next) (not . isVStart prev v $ next)