151 lines
4.5 KiB
JavaScript
151 lines
4.5 KiB
JavaScript
/**
|
|
* Copyright 2000, Silicon Graphics, Inc. All Rights Reserved.
|
|
* Copyright 2012, Google Inc. All Rights Reserved.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
* of this software and associated documentation files (the "Software"), to
|
|
* deal in the Software without restriction, including without limitation the
|
|
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
|
* sell copies of the Software, and to permit persons to whom the Software is
|
|
* furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice including the dates of first publication and
|
|
* either this permission notice or a reference to http://oss.sgi.com/projects/FreeB/
|
|
* shall be included in all copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
* SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
|
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
|
|
* IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
*
|
|
* Original Code. The Original Code is: OpenGL Sample Implementation,
|
|
* Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
|
|
* Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
|
|
* Copyright in any portions created by third parties is as indicated
|
|
* elsewhere herein. All Rights Reserved.
|
|
*/
|
|
|
|
/**
|
|
* @author ericv@cs.stanford.edu (Eric Veach)
|
|
* @author bckenny@google.com (Brendan Kenny)
|
|
*/
|
|
|
|
// require libtess.GluFace
|
|
// require libtess.GluHalfEdge
|
|
// require libtess.GluVertex
|
|
/*global libtess */
|
|
|
|
goog.provide('libtess.GluMesh');
|
|
goog.require('libtess');
|
|
goog.require('libtess.GluFace');
|
|
goog.require('libtess.GluHalfEdge');
|
|
goog.require('libtess.GluVertex');
|
|
|
|
|
|
|
|
/**
|
|
* Creates a new mesh with no edges, no vertices,
|
|
* and no loops (what we usually call a "face").
|
|
*
|
|
* @constructor
|
|
*/
|
|
libtess.GluMesh = function() {
|
|
/**
|
|
* dummy header for vertex list
|
|
* @type {libtess.GluVertex}
|
|
*/
|
|
this.vHead = new libtess.GluVertex();
|
|
|
|
/**
|
|
* dummy header for face list
|
|
* @type {libtess.GluFace}
|
|
*/
|
|
this.fHead = new libtess.GluFace();
|
|
|
|
/**
|
|
* dummy header for edge list
|
|
* @type {libtess.GluHalfEdge}
|
|
*/
|
|
this.eHead = new libtess.GluHalfEdge();
|
|
|
|
/**
|
|
* and its symmetric counterpart
|
|
* @type {libtess.GluHalfEdge}
|
|
*/
|
|
this.eHeadSym = new libtess.GluHalfEdge();
|
|
|
|
// TODO(bckenny): better way to pair these?
|
|
this.eHead.sym = this.eHeadSym;
|
|
this.eHeadSym.sym = this.eHead;
|
|
};
|
|
|
|
|
|
// TODO(bckenny): #ifndef NDEBUG
|
|
/**
|
|
* Checks mesh for self-consistency.
|
|
*/
|
|
libtess.GluMesh.prototype.checkMesh = function() {
|
|
if (!libtess.DEBUG) {
|
|
return;
|
|
}
|
|
|
|
var fHead = this.fHead;
|
|
var vHead = this.vHead;
|
|
var eHead = this.eHead;
|
|
|
|
var e;
|
|
|
|
// faces
|
|
var f;
|
|
var fPrev = fHead;
|
|
for (fPrev = fHead; (f = fPrev.next) !== fHead; fPrev = f) {
|
|
libtess.assert(f.prev === fPrev);
|
|
e = f.anEdge;
|
|
do {
|
|
libtess.assert(e.sym !== e);
|
|
libtess.assert(e.sym.sym === e);
|
|
libtess.assert(e.lNext.oNext.sym === e);
|
|
libtess.assert(e.oNext.sym.lNext === e);
|
|
libtess.assert(e.lFace === f);
|
|
e = e.lNext;
|
|
} while (e !== f.anEdge);
|
|
}
|
|
libtess.assert(f.prev === fPrev && f.anEdge === null && f.data === null);
|
|
|
|
// vertices
|
|
var v;
|
|
var vPrev = vHead;
|
|
for (vPrev = vHead; (v = vPrev.next) !== vHead; vPrev = v) {
|
|
libtess.assert(v.prev === vPrev);
|
|
e = v.anEdge;
|
|
do {
|
|
libtess.assert(e.sym !== e);
|
|
libtess.assert(e.sym.sym === e);
|
|
libtess.assert(e.lNext.oNext.sym === e);
|
|
libtess.assert(e.oNext.sym.lNext === e);
|
|
libtess.assert(e.org === v);
|
|
e = e.oNext;
|
|
} while (e !== v.anEdge);
|
|
}
|
|
libtess.assert(v.prev === vPrev && v.anEdge === null && v.data === null);
|
|
|
|
// edges
|
|
var ePrev = eHead;
|
|
for (ePrev = eHead; (e = ePrev.next) !== eHead; ePrev = e) {
|
|
libtess.assert(e.sym.next === ePrev.sym);
|
|
libtess.assert(e.sym !== e);
|
|
libtess.assert(e.sym.sym === e);
|
|
libtess.assert(e.org !== null);
|
|
libtess.assert(e.dst() !== null);
|
|
libtess.assert(e.lNext.oNext.sym === e);
|
|
libtess.assert(e.oNext.sym.lNext === e);
|
|
}
|
|
libtess.assert(e.sym.next === ePrev.sym &&
|
|
e.sym === this.eHeadSym &&
|
|
e.sym.sym === e &&
|
|
e.org === null && e.dst() === null &&
|
|
e.lFace === null && e.rFace() === null);
|
|
};
|