Class delaunay
java.lang.Object
gov.nih.mipav.view.renderer.WildMagic.AAM.delaunay
Edgeset of Delaunay triangulation ( L2-norm). Steve J. Fortune (1987) A
Sweepline Algorithm for Voronoi Diagrams, Algorithmica 2, 153-174.
http://www.netlib.org/voronoi/sweep2
This is Java modified version of Steve J. Fortune's Sweepline algorithm for
Voronoi diagrams. It generates either Voronoi diagram or the Delaunay
triangulation with given set of points. The Delaunay triangulation is used in
the AAM model for the automatic prostate segmentation. It reads the double
VOIs contour from each 2D slice, and generate the Delaunay triangulation for
shape analysis.
The author of this software is Steven Fortune. Copyright (c) 1994 by ATinvalid input: '&T'
Bell Laboratories.
Permission to use, copy, modify, and distribute this software for any
purpose without fee is hereby granted, provided that this entire notice
is included in all copies of any software which is or includes a copy
or modification of this software and in all copies of the supporting
documentation for such software.
THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
WARRANTY. IN PARTICULAR, NEITHER THE AUTHORS NOR ATinvalid input: '&T' MAKE ANY
REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
- Author:
- Ruida Cheng
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescription(package private) class(package private) class(package private) class(package private) class(package private) class -
Field Summary
FieldsModifier and TypeFieldDescription(package private) floatintfloatfloat(package private) delaunay.Halfedge[](package private) int(package private) delaunay.Halfedge(package private) delaunay.Halfedgestatic intint(package private) int(package private) intstatic final int(package private) intprivate intint(package private) int(package private) delaunay.Halfedge[](package private) int(package private) int(package private) float(package private) float(package private) float(package private) floatstatic int(package private) intint(package private) int(package private) int(package private) Vector<delaunay.Triangle> intfloatfloatfloatfloat -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoidaddTriangle(delaunay.Site s1, delaunay.Site s2, delaunay.Site s3) int[]ATTDelaunay(double[] xVec, double[] yVec, int nbPoints, int[] numTriangles) bisect(delaunay.Site s1, delaunay.Site s2) intvoidfloatdist(delaunay.Site s, delaunay.Site t) voidELgethash(int b) voidvoidELinsert(delaunay.Halfedge lb, delaunay.Halfedge newEdge) voidendpoint(delaunay.Edge e, int lr, delaunay.Site s) voidgeominit()HEcreate(delaunay.Edge e, int pm) intersect(delaunay.Halfedge el1, delaunay.Halfedge el2) voidnextone()voidvoidvoidvoidout_triple(delaunay.Site s1, delaunay.Site s2, delaunay.Site s3) voidvoidplotinit()PQ_min()intvoidbooleanPQempty()voidvoidPQinsert(delaunay.Halfedge he, delaunay.Site v, float offset) readone()voidintreadSites(double[] xVec, double[] yVec, int nbPoints) voidref(delaunay.Site v) intintscomp(delaunay.Point s1, delaunay.Point s2) voidvoronoi(int triangulate, boolean output)
-
Field Details
-
NULL
public static final int NULL- See Also:
-
DELETED
-
xmin
public float xmin -
xmax
public float xmax -
ymin
public float ymin -
ymax
public float ymax -
deltax
public float deltax -
deltay
public float deltay -
triangulate
public int triangulate -
sorted
public int sorted -
plot
public int plot -
debug
public int debug -
sites
-
nsites
int nsites -
siteidx
int siteidx -
sqrt_nsites
int sqrt_nsites -
nvertices
int nvertices -
bottomsite
-
le
public static int le -
re
public static int re -
nedges
public int nedges -
ELleftend
delaunay.Halfedge ELleftend -
ELrightend
delaunay.Halfedge ELrightend -
ELhashsize
int ELhashsize -
ELhash
delaunay.Halfedge[] ELhash -
PQhashsize
int PQhashsize -
PQhash
delaunay.Halfedge[] PQhash -
PQcount
int PQcount -
PQmin
int PQmin -
pxmin
float pxmin -
pxmax
float pxmax -
pymin
float pymin -
pymax
float pymax -
cradius
float cradius -
reader
-
in
-
triangles
Vector<delaunay.Triangle> triangles -
outTriangles
private int outTriangles -
ntry
int ntry -
totalsearch
int totalsearch
-
-
Constructor Details
-
delaunay
public delaunay()
-
-
Method Details
-
ELinitialize
public void ELinitialize() -
HEcreate
-
ELinsert
-
ELgethash
-
ELleftbnd
-
ELdelete
-
ELright
-
ELleft
-
leftreg
-
rightreg
-
PQinsert
-
PQdelete
-
PQbucket
-
PQempty
public boolean PQempty() -
PQ_min
-
PQextractmin
-
PQinitialize
public void PQinitialize() -
geominit
public void geominit() -
bisect
-
intersect
-
right_of
-
endpoint
-
dist
-
makevertex
-
deref
-
ref
-
voronoi
public void voronoi(int triangulate, boolean output) -
scomp
-
nextone
-
ATTDelaunay
public int[] ATTDelaunay(double[] xVec, double[] yVec, int nbPoints, int[] numTriangles) -
readSites
public int readSites(double[] xVec, double[] yVec, int nbPoints) -
readsites
public void readsites() -
readone
-
out_bisector
-
out_ep
-
out_vertex
-
out_site
-
out_triple
-
addTriangle
-
plotinit
public void plotinit() -
clip_line
-