source: osm/applications/editors/josm/plugins/cadastre-fr/src/cadastre_fr/SimplifyWay.java@ 20390

Last change on this file since 20390 was 20390, checked in by pieren, 14 years ago

Many small fixes and improvements

File size: 4.7 KB
Line 
1// License: GPL. v2 and later. Copyright 2008-2009 by Pieren <pieren3@gmail.com> and others
2package cadastre_fr;
3
4import java.util.ArrayList;
5import java.util.List;
6
7import org.openstreetmap.josm.data.osm.Node;
8import org.openstreetmap.josm.data.osm.Way;
9
10/**
11 * Imported from plugin UtilsPlugin
12 * @author
13 *
14 */
15public class SimplifyWay {
16 public void simplifyWay(Way w/*, DataSet dataSet*/, double threshold) {
17 Way wnew = new Way(w);
18
19// int toI = wnew.getNodesCount() - 1;
20// List<OsmPrimitive> parents = new ArrayList<OsmPrimitive>();
21// for (int i = wnew.getNodesCount() - 1; i >= 0; i--) {
22// //CollectBackReferencesVisitor backRefsV = new CollectBackReferencesVisitor(dataSet, false);
23// //backRefsV.visit(wnew.getNode(i));
24// parents.addAll(w.getNode(i).getReferrers());
25// boolean used = false;
26// if (parents.size() == 1) {
27// used = Collections.frequency(w.getNodes(), wnew.getNode(i)) > 1;
28// } else {
29// //backRefsV.getData().remove(w);
30// parents.remove(w);
31// used = !parents.isEmpty();
32// }
33// if (!used)
34// used = wnew.getNode(i).isTagged();
35//
36// if (used) {
37// simplifyWayRange(wnew, i, toI, threshold);
38// toI = i;
39// }
40// }
41 simplifyWayRange(wnew, 0, wnew.getNodesCount() - 1, threshold);
42 w.setNodes(wnew.getNodes());
43// HashSet<Node> delNodes = new HashSet<Node>();
44// delNodes.addAll(w.getNodes());
45// delNodes.removeAll(wnew.getNodes());
46
47// if (wnew.getNodesCount() != w.getNodesCount()) {
48// Collection<Command> cmds = new LinkedList<Command>();
49// cmds.add(new ChangeCommand(w, wnew));
50// cmds.add(new DeleteCommand(delNodes));
51// Main.main.undoRedo.add(new SequenceCommand(trn("Simplify Way (remove {0} node)", "Simplify Way (remove {0} nodes)", delNodes.size(), delNodes.size()), cmds));
52// Main.map.repaint();
53// }
54 }
55
56 public void simplifyWayRange(Way wnew, int from, int to, double thr) {
57 if (to - from >= 2) {
58 ArrayList<Node> ns = new ArrayList<Node>();
59 simplifyWayRange(wnew, from, to, ns, thr);
60 List<Node> nodes = wnew.getNodes();
61 for (int j = to - 1; j > from; j--)
62 nodes.remove(j);
63 nodes.addAll(from+1, ns);
64 wnew.setNodes(nodes);
65 }
66 }
67
68 /*
69 * Takes an interval [from,to] and adds nodes from (from,to) to ns.
70 * (from and to are indices of wnew.nodes.)
71 */
72 public void simplifyWayRange(Way wnew, int from, int to, ArrayList<Node> ns, double thr) {
73 Node fromN = wnew.getNode(from), toN = wnew.getNode(to);
74
75 int imax = -1;
76 double xtemax = 0;
77 for (int i = from + 1; i < to; i++) {
78 Node n = wnew.getNode(i);
79 double xte = Math.abs(EARTH_RAD
80 * xtd(fromN.getCoor().lat() * Math.PI / 180, fromN.getCoor().lon() * Math.PI / 180, toN.getCoor().lat() * Math.PI
81 / 180, toN.getCoor().lon() * Math.PI / 180, n.getCoor().lat() * Math.PI / 180, n.getCoor().lon() * Math.PI
82 / 180));
83 if (xte > xtemax) {
84 xtemax = xte;
85 imax = i;
86 }
87 }
88
89 if (imax != -1 && xtemax >= thr) {
90 simplifyWayRange(wnew, from, imax, ns, thr);
91 ns.add(wnew.getNode(imax));
92 simplifyWayRange(wnew, imax, to, ns, thr);
93 }
94 }
95 public static double EARTH_RAD = 6378137.0;
96 /* From Aviaton Formulary v1.3
97 * http://williams.best.vwh.net/avform.htm
98 */
99 public static double dist(double lat1, double lon1, double lat2, double lon2) {
100 return 2 * Math.asin(Math.sqrt(Math.pow(Math.sin((lat1 - lat2) / 2), 2) + Math.cos(lat1) * Math.cos(lat2)
101 * Math.pow(Math.sin((lon1 - lon2) / 2), 2)));
102 }
103
104 public static double course(double lat1, double lon1, double lat2, double lon2) {
105 return Math.atan2(Math.sin(lon1 - lon2) * Math.cos(lat2), Math.cos(lat1) * Math.sin(lat2) - Math.sin(lat1)
106 * Math.cos(lat2) * Math.cos(lon1 - lon2))
107 % (2 * Math.PI);
108 }
109 public static double xtd(double lat1, double lon1, double lat2, double lon2, double lat3, double lon3) {
110 double dist_AD = dist(lat1, lon1, lat3, lon3);
111 double crs_AD = course(lat1, lon1, lat3, lon3);
112 double crs_AB = course(lat1, lon1, lat2, lon2);
113 return Math.asin(Math.sin(dist_AD) * Math.sin(crs_AD - crs_AB));
114 }
115
116}
Note: See TracBrowser for help on using the repository browser.