Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* "Concave" hulls by Glenn Hudson and Matt Duckham
*
* Source code downloaded from https://archive.md/l3Un5#selection-571.0-587.218 on 3rd November 2021.
*
* - This software is Copyright (C) 2008 Glenn Hudson released under Gnu Public License (GPL). Under
* GPL you are free to use, modify, and redistribute the software. Please acknowledge Glenn Hudson
* and Matt Duckham as the source of this software if you do use or adapt the code in further research
* or other work. For full details of GPL see http://www.gnu.org/licenses/gpl-3.0.txt.
* - This software comes with no warranty of any kind, expressed or implied.
*
* A paper with full details of the characteristic hulls algorithm is published in Pattern Recognition.
* Duckham, M., Kulik, L., Worboys, M.F., Galton, A. (2008) Efficient generation of simple polygons for
* characterizing the shape of a set of points in the plane. Pattern Recognition v41, 3224-3236
*
* The software was developed by Glenn Hudson while working with me as an RA. The characteristic shapes
* algorithm is collaborative work between Matt Duckham, Lars Kulik, Antony Galton, and Mike Worboys.
*
*/
package signalprocesser.voronoi.statusstructure;
import java.awt.Graphics2D;
import java.awt.Rectangle;
import signalprocesser.voronoi.VoronoiTest;
import signalprocesser.voronoi.eventqueue.EventQueue;
import signalprocesser.voronoi.eventqueue.VSiteEvent;
import signalprocesser.voronoi.statusstructure.binarysearchtreeimpl.BSTStatusStructure;
abstract public class AbstractStatusStructure {
/* ***************************************************** */
// Static Entry Point
public static AbstractStatusStructure createDefaultStatusStructure() {
return new BSTStatusStructure();
//return new DLinkedListStatusStructure();
}
/* ***************************************************** */
// General Methods
abstract public boolean isStatusStructureEmpty();
abstract public void setRootNode( VSiteEvent siteevent );
abstract public VLinkedNode insertNode( VLinkedNode nodetosplit, VSiteEvent siteevent );
abstract public void removeNode(EventQueue eventqueue, VLinkedNode toremove);
public VLinkedNode getNodeAboveSiteEvent( VSiteEvent siteevent , int sweepline ) {
return getNodeAboveSiteEvent(siteevent.getX(), sweepline);
}
abstract public VLinkedNode getNodeAboveSiteEvent( int siteevent_x , int sweepline);
abstract public VLinkedNode getHeadNode();
/* ***************************************************** */
// Debug print() Method
public void print(Graphics2D g, VSiteEvent siteevent, int sweepline) {
// Get clip bounds
Rectangle bounds = g.getClipBounds();
// Print straight line of y=sweepline
g.drawLine(bounds.x, sweepline, bounds.x+bounds.width, sweepline);
// Re-draw tree
if ( this instanceof BSTStatusStructure && VoronoiTest.treedialog!=null ) {
VoronoiTest.treedialog.setRootNode(((BSTStatusStructure)this).getRootNode(), sweepline);
}
// Print double linked list info
if ( siteevent!=null ) {
if ( this instanceof BSTStatusStructure ) {
g.drawString(((BSTStatusStructure)this).strDoublyLinkedList(sweepline), 10, 10);
}
// Highlight leafnode above site
VLinkedNode nodeabovesite = getNodeAboveSiteEvent(siteevent, sweepline);
if ( nodeabovesite!=null ) {
g.drawOval(nodeabovesite.siteevent.getX()-10,nodeabovesite.siteevent.getY()-10, 20, 20);
int yintersect = sweepline + nodeabovesite.siteevent.getYValueOfParabola(siteevent.getX());
g.drawLine( siteevent.getX(), siteevent.getY(), siteevent.getX(), yintersect );
}
}
// Use the getLeafNodeAboveSiteEvent() rather than writing a more
// specialised/efficent method to verify its integrity
for ( int x=bounds.x ; x
