new PriorityQ()
A priority queue of vertices, ordered by libtess.geom.vertLeq, implemented
with a sorted array. Used for initial insertion of vertices (see
libtess.sweep.initPriorityQ_), sorted once, then it uses an internal
libtess.PriorityQHeap for any subsequently created vertices from
intersections.
- Source:
Methods
deleteQ()
Release major storage memory used by priority queue.
- Source:
extractMin() → {libtess.GluVertex}
Removes the minimum vertex from the queue and returns it. If the queue is
empty, null will be returned.
- Source:
Returns:
- Type
- libtess.GluVertex
init()
Sort vertices by libtess.geom.vertLeq. Must be called before any method other
than insert is called to ensure correctness when removing or querying.
- Source:
insert(vert) → {libtess.PQHandle}
Insert a vertex into the priority queue. Returns a PQHandle to refer to it,
which will never be 0.
Parameters:
| Name | Type | Description |
|---|---|---|
vert |
libtess.GluVertex |
- Source:
Returns:
- Type
- libtess.PQHandle
minimum() → {libtess.GluVertex}
Returns the minimum vertex in the queue. If the queue is empty, null will be
returned.
- Source:
Returns:
- Type
- libtess.GluVertex
remove(removeHandle)
Remove vertex with handle removeHandle from queue.
Parameters:
| Name | Type | Description |
|---|---|---|
removeHandle |
libtess.PQHandle |
- Source: