CDPolygonNs.java 3.79 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
/*-
 *  Copyright 2020 Beuth Hochschule für Technik Berlin, Hochschule für Technik Stuttgart
 * 
 *  This file is part of CityDoctor2.
 *
 *  CityDoctor2 is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU Lesser General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  CityDoctor2 is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public License
 *  along with CityDoctor2.  If not, see <https://www.gnu.org/licenses/>.
 */
package de.hft.stuttgart.citydoctor2.edge;


import java.util.ArrayList;
import java.util.List;
23
24
25
26
27
import java.util.Map;

import de.hft.stuttgart.citydoctor2.datastructure.LinearRing;
import de.hft.stuttgart.citydoctor2.datastructure.Polygon;
import de.hft.stuttgart.citydoctor2.datastructure.Vertex;
28
29
30
31

public class CDPolygonNs extends PolygonNs {
	
	private List<List<HalfEdge>> innerHalfEdges = new ArrayList<>();
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
	
	public static CDPolygonNs of(Polygon p, Map<Vertex, Coordinate3d> pointMap) {
		List<List<Coordinate3d>> loopCoordinates = new ArrayList<>();
		List<Coordinate3d> edgeExtRing = createCoordinatesFromRing(pointMap, p.getExteriorRing().getVertices());
		loopCoordinates.add(edgeExtRing);
		
		for (LinearRing innerRing : p.getInnerRings()) {
			List<Coordinate3d> edgeInnerRing = createCoordinatesFromRing(pointMap, innerRing.getVertices());
			loopCoordinates.add(edgeInnerRing);
		}
		
		List<List<HalfEdge>> halfEdges = new ArrayList<>();
		for (List<Coordinate3d> ringCoordinates : loopCoordinates) {
			List<HalfEdge> currHeList = createHalfEdgesFromCoordinates(ringCoordinates);
			halfEdges.add(currHeList);
		}
		
		return new CDPolygonNs(halfEdges, p);
	}
	
	private static List<HalfEdge> createHalfEdgesFromCoordinates(List<Coordinate3d> ringCoordinates) {
		List<HalfEdge> currHeList = new ArrayList<>();
		HalfEdge prevHalfEdge = null;
		for (int currCoordIndex = 1; currCoordIndex < ringCoordinates.size(); currCoordIndex++) {
			int prevCoordIndex = currCoordIndex - 1;
			Coordinate3d currCoord = ringCoordinates.get(currCoordIndex);
			Coordinate3d prevCoord = ringCoordinates.get(prevCoordIndex);
			HalfEdge e = new HalfEdge(prevCoord, currCoord);
			if (prevHalfEdge != null) {
				prevHalfEdge.setNext(e);
			}
			currHeList.add(e);
			prevHalfEdge = e;
		}
		if (prevHalfEdge == null) {
			throw new IllegalStateException("No half edges were created");
		}
		Coordinate3d start = ringCoordinates.get(0);
		Coordinate3d end = ringCoordinates.get(ringCoordinates.size() - 1);
		HalfEdge e = new HalfEdge(end, start);
		prevHalfEdge.setNext(e);
		e.setNext(currHeList.get(0));
		currHeList.add(e);
		return currHeList;
	}
	
	private static List<Coordinate3d> createCoordinatesFromRing(Map<Vertex, Coordinate3d> pointMap,
			List<Vertex> vertices) {
		List<Coordinate3d> edgeRing = new ArrayList<>();
		for (int i = 0; i < vertices.size() - 1; i++) {
			Vertex v = vertices.get(i);
			Coordinate3d c = pointMap.computeIfAbsent(v, key -> new Coordinate3d(key.getX(), key.getY(), key.getZ()));
			edgeRing.add(c);
		}
		return edgeRing;
	}
88

89
90
	public CDPolygonNs(List<List<HalfEdge>> halfEdges, Polygon original) {
		super(halfEdges.get(0), original);
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
		
		for (int i = 1; i < halfEdges.size(); i++) {
			List<HalfEdge> loopEdges = halfEdges.get(i);
			for (HalfEdge e : loopEdges) {
				addChild(e);
			}
			innerHalfEdges.add(loopEdges);
		}
	}
	
	public List<List<HalfEdge>> getInnerHalfEdges() {
		return innerHalfEdges;
	}
	

}