com.sun.j3d.utils.geometry.Heap Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of java3d-core Show documentation
Show all versions of java3d-core Show documentation
Java3D Core And Java3D Util Libraries
The newest version!
/*
* Copyright (c) 2007 Sun Microsystems, Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistribution of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* - Redistribution in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* Neither the name of Sun Microsystems, Inc. or the names of
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* This software is provided "AS IS," without a warranty of any
* kind. ALL EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND
* WARRANTIES, INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT, ARE HEREBY
* EXCLUDED. SUN MICROSYSTEMS, INC. ("SUN") AND ITS LICENSORS SHALL
* NOT BE LIABLE FOR ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF
* USING, MODIFYING OR DISTRIBUTING THIS SOFTWARE OR ITS
* DERIVATIVES. IN NO EVENT WILL SUN OR ITS LICENSORS BE LIABLE FOR
* ANY LOST REVENUE, PROFIT OR DATA, OR FOR DIRECT, INDIRECT, SPECIAL,
* CONSEQUENTIAL, INCIDENTAL OR PUNITIVE DAMAGES, HOWEVER CAUSED AND
* REGARDLESS OF THE THEORY OF LIABILITY, ARISING OUT OF THE USE OF OR
* INABILITY TO USE THIS SOFTWARE, EVEN IF SUN HAS BEEN ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGES.
*
* You acknowledge that this software is not designed, licensed or
* intended for use in the design, construction, operation or
* maintenance of any nuclear facility.
*
*/
// ----------------------------------------------------------------------
//
// The reference to Fast Industrial Strength Triangulation (FIST) code
// in this release by Sun Microsystems is related to Sun's rewrite of
// an early version of FIST. FIST was originally created by Martin
// Held and Joseph Mitchell at Stony Brook University and is
// incorporated by Sun under an agreement with The Research Foundation
// of SUNY (RFSUNY). The current version of FIST is available for
// commercial use under a license agreement with RFSUNY on behalf of
// the authors and Stony Brook University. Please contact the Office
// of Technology Licensing at Stony Brook, phone 631-632-9009, for
// licensing information.
//
// ----------------------------------------------------------------------
package com.sun.j3d.utils.geometry;
class Heap {
static void printHeapData(Triangulator triRef) {
int i;
System.out.println("\nHeap Data : numZero " + triRef.numZero +
" numHeap " + triRef.numHeap);
for(i=0; i< triRef.numHeap; i++)
System.out.println(i + " ratio " + triRef.heap[i].ratio + ", index " +
triRef.heap[i].index + ", prev " +
triRef.heap[i].prev + ", next " +
triRef.heap[i].next);
System.out.println(" ");
}
static void initHeap(Triangulator triRef) {
// Calculate the maximum bounds : N + (N -2)* 2.
// triRef.maxNumHeap = triRef.numPoints * 3;
triRef.maxNumHeap = triRef.numPoints;
triRef.heap = new HeapNode[triRef.maxNumHeap];
triRef.numHeap = 0;
triRef.numZero = 0;
}
static void storeHeapData(Triangulator triRef, int index, double ratio,
int ind, int prev, int next) {
triRef.heap[index] = new HeapNode();
triRef.heap[index].ratio = ratio;
triRef.heap[index].index = ind;
triRef.heap[index].prev = prev;
triRef.heap[index].next = next;
}
static void dumpOnHeap(Triangulator triRef, double ratio,
int ind, int prev, int next) {
int index;
if (triRef.numHeap >= triRef.maxNumHeap) {
// System.out.println("Heap:dumpOnHeap.Expanding heap array ...");
HeapNode old[] = triRef.heap;
triRef.maxNumHeap = triRef.maxNumHeap + triRef.numPoints;
triRef.heap = new HeapNode[triRef.maxNumHeap];
System.arraycopy(old, 0, triRef.heap, 0, old.length);
}
if (ratio == 0.0) {
if (triRef.numZero < triRef.numHeap)
if(triRef.heap[triRef.numHeap] == null)
storeHeapData(triRef, triRef.numHeap, triRef.heap[triRef.numZero].ratio,
triRef.heap[triRef.numZero].index,
triRef.heap[triRef.numZero].prev,
triRef.heap[triRef.numZero].next);
else
triRef.heap[triRef.numHeap].copy(triRef.heap[triRef.numZero]);
/*
storeHeapData(triRef, triRef.numHeap, triRef.heap[triRef.numZero].ratio,
triRef.heap[triRef.numZero].index,
triRef.heap[triRef.numZero].prev,
triRef.heap[triRef.numZero].next);
*/
index = triRef.numZero;
++triRef.numZero;
}
else {
index = triRef.numHeap;
}
storeHeapData(triRef, index, ratio, ind, prev, next);
++triRef.numHeap;
}
static void insertIntoHeap(Triangulator triRef, double ratio,
int ind, int prev, int next) {
dumpOnHeap(triRef, ratio, ind, prev, next);
}
static boolean deleteFromHeap(Triangulator triRef, int[] ind,
int[] prev, int[] next) {
double rnd;
int rndInd;
// earSorted is not implemented yet.
if (triRef.numZero > 0) {
// assert(num_heap >= num_zero);
--triRef.numZero;
--triRef.numHeap;
ind[0] = triRef.heap[triRef.numZero].index;
prev[0] = triRef.heap[triRef.numZero].prev;
next[0] = triRef.heap[triRef.numZero].next;
if (triRef.numZero < triRef.numHeap)
triRef.heap[triRef.numZero].copy(triRef.heap[triRef.numHeap]);
/*
storeHeapData( triRef, triRef.numZero, triRef.heap[triRef.numHeap].ratio,
triRef.heap[triRef.numHeap].index,
triRef.heap[triRef.numHeap].prev,
triRef.heap[triRef.numHeap].next);
*/
return true;
}
else if (triRef.earsRandom) {
if (triRef.numHeap <= 0) {
triRef.numHeap = 0;
return false;
}
rnd = triRef.randomGen.nextDouble();
rndInd = (int)(rnd * triRef.numHeap);
--triRef.numHeap;
if (rndInd > triRef.numHeap) rndInd = triRef.numHeap;
ind[0] = triRef.heap[rndInd].index;
prev[0] = triRef.heap[rndInd].prev;
next[0] = triRef.heap[rndInd].next;
if (rndInd < triRef.numHeap)
triRef.heap[rndInd].copy(triRef.heap[triRef.numHeap]);
/*
storeHeapData( triRef, rndInd, triRef.heap[triRef.numHeap].ratio,
triRef.heap[triRef.numHeap].index,
triRef.heap[triRef.numHeap].prev,
triRef.heap[triRef.numHeap].next);
*/
return true;
}
else {
if (triRef.numHeap <= 0) {
triRef.numHeap = 0;
return false;
}
--triRef.numHeap;
ind[0] = triRef.heap[triRef.numHeap].index;
prev[0] = triRef.heap[triRef.numHeap].prev;
next[0] = triRef.heap[triRef.numHeap].next;
return true;
}
// return false;
}
}