Statistics
| Revision:

root / trunk / extensions / extGraph / src / org / gvsig / fmap / algorithm / triangulation / AbstractTriangulator.java @ 22583

History | View | Annotate | Download (2 KB)

1
/* gvSIG. Geographic Information System of the Valencian Government
2
 *
3
 * Copyright (C) 2007-2008 Infrastructures and Transports Department
4
 * of the Valencian Government (CIT)
5
 * 
6
 * This program is free software; you can redistribute it and/or
7
 * modify it under the terms of the GNU General Public License
8
 * as published by the Free Software Foundation; either version 2
9
 * of the License, or (at your option) any later version.
10
 * 
11
 * This program is distributed in the hope that it will be useful,
12
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
14
 * GNU General Public License for more details.
15
 * 
16
 * You should have received a copy of the GNU General Public License
17
 * along with this program; if not, write to the Free Software
18
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, 
19
 * MA  02110-1301, USA.
20
 * 
21
 */
22

    
23
/*
24
 * AUTHORS (In addition to CIT):
25
 * 2008 Software Colaborativo (www.scolab.es)   development
26
 */
27

    
28
package org.gvsig.fmap.algorithm.triangulation;
29

    
30
import java.awt.geom.Rectangle2D;
31
import java.util.ArrayList;
32
import java.util.List;
33

    
34
/**
35
 * @author Francisco Jos? Pe?arrubia (fjp@scolab.es)
36
 * 
37
 */
38
public abstract class AbstractTriangulator implements Triangulator {
39

    
40
        protected TIN tin = new TIN();
41
        protected Rectangle2D.Double fullExtent = null;
42
        protected Vertex firstVertex = null;
43
//        protected List<Vertex> vertices = new ArrayList<Vertex>();
44
//        protected List<Triangle> triangles = new ArrayList<Triangle>();
45
        
46
        public void addVertex(Vertex v) {
47
                tin.addVertex(v);
48
                if (firstVertex != null)
49
                        if (fullExtent == null) {
50
                                fullExtent = new Rectangle2D.Double();
51
                                fullExtent.setFrameFromDiagonal(v.getX(), v.getY(), 
52
                                        firstVertex.getX(), firstVertex.getY());
53
                        }
54
                        else
55
                                fullExtent.add(v.getX(), v.getY());
56
                
57
                if (firstVertex == null) 
58
                        firstVertex = v;
59
        }
60

    
61
        public List<Triangle> getTriangles() {
62
                return tin.getTriangles();
63
        }
64

    
65

    
66
}