source: josm/trunk/src/org/openstreetmap/josm/actions/CreateCircleAction.java@ 6388

Last change on this file since 6388 was 6380, checked in by Don-vip, 10 years ago

update license/copyright information
  • Property svn:eol-style set to native
File size: 10.9 KB
Line 
1// License: GPL. For details, see LICENSE file.
2package org.openstreetmap.josm.actions;
3
4import static org.openstreetmap.josm.gui.help.HelpUtil.ht;
5import static org.openstreetmap.josm.tools.I18n.tr;
6
7import java.awt.event.ActionEvent;
8import java.awt.event.KeyEvent;
9import java.util.ArrayList;
10import java.util.Collection;
11import java.util.LinkedList;
12import java.util.List;
13
14import javax.swing.JOptionPane;
15
16import org.openstreetmap.josm.Main;
17import org.openstreetmap.josm.command.AddCommand;
18import org.openstreetmap.josm.command.ChangeCommand;
19import org.openstreetmap.josm.command.Command;
20import org.openstreetmap.josm.command.DeleteCommand;
21import org.openstreetmap.josm.command.SequenceCommand;
22import org.openstreetmap.josm.data.coor.EastNorth;
23import org.openstreetmap.josm.data.osm.Node;
24import org.openstreetmap.josm.data.osm.OsmPrimitive;
25import org.openstreetmap.josm.data.osm.Way;
26import org.openstreetmap.josm.gui.Notification;
27import org.openstreetmap.josm.tools.Shortcut;
28
29/**
30 * - Create a new circle from two selected nodes or a way with 2 nodes which represent the diameter of the circle.
31 * - Create a new circle from three selected nodes--or a way with 3 nodes.
32 * - Useful for roundabouts
33 *
34 * Note: If a way is selected, it is changed. If nodes are selected a new way is created.
35 * So if you've got a way with nodes it makes a difference between running this on the way or the nodes!
36 *
37 * BTW: Someone might want to implement projection corrections for this...
38 *
39 * @author Henry Loenwind, based on much copy&Paste from other Actions.
40 * @author Sebastian Masch
41 */
42public final class CreateCircleAction extends JosmAction {
43
44 /**
45 * Constructs a new {@code CreateCircleAction}.
46 */
47 public CreateCircleAction() {
48 super(tr("Create Circle"), "createcircle", tr("Create a circle from three selected nodes."),
49 Shortcut.registerShortcut("tools:createcircle", tr("Tool: {0}", tr("Create Circle")),
50 KeyEvent.VK_O, Shortcut.SHIFT), true);
51 putValue("help", ht("/Action/CreateCircle"));
52 }
53
54 private double calcang(double xc, double yc, double x, double y) {
55 // calculate the angle from xc|yc to x|y
56 if (xc == x && yc == y)
57 return 0; // actually invalid, but we won't have this case in this context
58 double yd = Math.abs(y - yc);
59 if (yd == 0 && xc < x)
60 return 0;
61 if (yd == 0 && xc > x)
62 return Math.PI;
63 double xd = Math.abs(x - xc);
64 double a = Math.atan2(xd, yd);
65 if (y > yc) {
66 a = Math.PI - a;
67 }
68 if (x < xc) {
69 a = -a;
70 }
71 a = 1.5*Math.PI + a;
72 if (a < 0) {
73 a += 2*Math.PI;
74 }
75 if (a >= 2*Math.PI) {
76 a -= 2*Math.PI;
77 }
78 return a;
79 }
80
81 @Override
82 public void actionPerformed(ActionEvent e) {
83 if (!isEnabled())
84 return;
85
86 int numberOfNodesInCircle = Main.pref.getInteger("createcircle.nodecount", 8);
87 if (numberOfNodesInCircle < 1) {
88 numberOfNodesInCircle = 1;
89 } else if (numberOfNodesInCircle > 100) {
90 numberOfNodesInCircle = 100;
91 }
92
93 Collection<OsmPrimitive> sel = getCurrentDataSet().getSelected();
94 List<Node> nodes = new LinkedList<Node>();
95 Way existingWay = null;
96
97 for (OsmPrimitive osm : sel)
98 if (osm instanceof Node) {
99 nodes.add((Node)osm);
100 }
101
102 // special case if no single nodes are selected and exactly one way is:
103 // then use the way's nodes
104 if (nodes.isEmpty() && (sel.size() == 1)) {
105 for (OsmPrimitive osm : sel)
106 if (osm instanceof Way) {
107 existingWay = ((Way)osm);
108 for (Node n : ((Way)osm).getNodes())
109 {
110 if(!nodes.contains(n)) {
111 nodes.add(n);
112 }
113 }
114 }
115 }
116
117 // now we can start doing things to OSM data
118 Collection<Command> cmds = new LinkedList<Command>();
119
120 if (nodes.size() == 2) {
121 // diameter: two single nodes needed or a way with two nodes
122
123 Node n1 = nodes.get(0);
124 double x1 = n1.getEastNorth().east();
125 double y1 = n1.getEastNorth().north();
126 Node n2 = nodes.get(1);
127 double x2 = n2.getEastNorth().east();
128 double y2 = n2.getEastNorth().north();
129
130 // calculate the center (xc/yc)
131 double xc = 0.5 * (x1 + x2);
132 double yc = 0.5 * (y1 + y2);
133
134 // calculate the radius (r)
135 double r = Math.sqrt(Math.pow(xc-x1,2) + Math.pow(yc-y1,2));
136
137 // find where to put the existing nodes
138 double a1 = calcang(xc, yc, x1, y1);
139 double a2 = calcang(xc, yc, x2, y2);
140 if (a1 < a2) { double at = a1; Node nt = n1; a1 = a2; n1 = n2; a2 = at; n2 = nt; }
141
142 // build a way for the circle
143 List<Node> wayToAdd = new ArrayList<Node>(numberOfNodesInCircle + 1);
144
145 for (int i = 1; i <= numberOfNodesInCircle; i++) {
146 double a = a2 + 2*Math.PI*(1.0 - i/(double)numberOfNodesInCircle); // "1-" to get it clock-wise
147
148 // insert existing nodes if they fit before this new node (999 means "already added this node")
149 if ((a1 < 999) && (a1 > a - 1E-9) && (a1 < a + 1E-9)) {
150 wayToAdd.add(n1);
151 a1 = 999;
152 }
153 else if ((a2 < 999) && (a2 > a - 1E-9) && (a2 < a + 1E-9)) {
154 wayToAdd.add(n2);
155 a2 = 999;
156 }
157 else {
158 // get the position of the new node and insert it
159 double x = xc + r*Math.cos(a);
160 double y = yc + r*Math.sin(a);
161 Node n = new Node(Main.getProjection().eastNorth2latlon(new EastNorth(x,y)));
162 wayToAdd.add(n);
163 cmds.add(new AddCommand(n));
164 }
165 }
166 wayToAdd.add(wayToAdd.get(0)); // close the circle
167 if (existingWay == null) {
168 Way newWay = new Way();
169 newWay.setNodes(wayToAdd);
170 cmds.add(new AddCommand(newWay));
171 } else {
172 Way newWay = new Way(existingWay);
173 newWay.setNodes(wayToAdd);
174 cmds.add(new ChangeCommand(existingWay, newWay));
175 }
176
177 // the first node may be unused/abandoned if createcircle.nodecount is odd
178 if (a1 < 999) {
179 // if it is, delete it
180 List<OsmPrimitive> parents = n1.getReferrers();
181 if (parents.isEmpty() || ((parents.size() == 1) && (parents.contains(existingWay)))) {
182 cmds.add(new DeleteCommand(n1));
183 }
184 }
185
186 } else if (nodes.size() == 3) {
187 // triangle: three single nodes needed or a way with three nodes
188
189 // let's get some shorter names
190 Node n1 = nodes.get(0);
191 double x1 = n1.getEastNorth().east();
192 double y1 = n1.getEastNorth().north();
193 Node n2 = nodes.get(1);
194 double x2 = n2.getEastNorth().east();
195 double y2 = n2.getEastNorth().north();
196 Node n3 = nodes.get(2);
197 double x3 = n3.getEastNorth().east();
198 double y3 = n3.getEastNorth().north();
199
200 // calculate the center (xc/yc)
201 double s = 0.5*((x2 - x3)*(x1 - x3) - (y2 - y3)*(y3 - y1));
202 double sUnder = (x1 - x2)*(y3 - y1) - (y2 - y1)*(x1 - x3);
203
204 if (sUnder == 0) {
205 new Notification(
206 tr("Those nodes are not in a circle. Aborting."))
207 .setIcon(JOptionPane.WARNING_MESSAGE)
208 .show();
209 return;
210 }
211
212 s /= sUnder;
213
214 double xc = 0.5*(x1 + x2) + s*(y2 - y1);
215 double yc = 0.5*(y1 + y2) + s*(x1 - x2);
216
217 // calculate the radius (r)
218 double r = Math.sqrt(Math.pow(xc-x1,2) + Math.pow(yc-y1,2));
219
220 // find where to put the existing nodes
221 double a1 = calcang(xc, yc, x1, y1);
222 double a2 = calcang(xc, yc, x2, y2);
223 double a3 = calcang(xc, yc, x3, y3);
224 if (a1 < a2) { double at = a1; Node nt = n1; a1 = a2; n1 = n2; a2 = at; n2 = nt; }
225 if (a2 < a3) { double at = a2; Node nt = n2; a2 = a3; n2 = n3; a3 = at; n3 = nt; }
226 if (a1 < a2) { double at = a1; Node nt = n1; a1 = a2; n1 = n2; a2 = at; n2 = nt; }
227
228 // build a way for the circle
229 List<Node> wayToAdd = new ArrayList<Node>();
230 for (int i = 1; i <= numberOfNodesInCircle; i++) {
231 double a = 2*Math.PI*(1.0 - i/(double)numberOfNodesInCircle); // "1-" to get it clock-wise
232 // insert existing nodes if they fit before this new node (999 means "already added this node")
233 if (a1 < 999 && a1 > a) {
234 wayToAdd.add(n1);
235 a1 = 999;
236 }
237 if (a2 < 999 && a2 > a) {
238 wayToAdd.add(n2);
239 a2 = 999;
240 }
241 if (a3 < 999 && a3 > a) {
242 wayToAdd.add(n3);
243 a3 = 999;
244 }
245 // get the position of the new node and insert it
246 double x = xc + r*Math.cos(a);
247 double y = yc + r*Math.sin(a);
248 Node n = new Node(Main.getProjection().eastNorth2latlon(new EastNorth(x,y)));
249 wayToAdd.add(n);
250 cmds.add(new AddCommand(n));
251 }
252 wayToAdd.add(wayToAdd.get(0)); // close the circle
253 if (existingWay == null) {
254 Way newWay = new Way();
255 newWay.setNodes(wayToAdd);
256 cmds.add(new AddCommand(newWay));
257 } else {
258 Way newWay = new Way(existingWay);
259 newWay.setNodes(wayToAdd);
260 cmds.add(new ChangeCommand(existingWay, newWay));
261 }
262
263 } else {
264 new Notification(
265 tr("Please select exactly two or three nodes or one way with exactly two or three nodes."))
266 .setIcon(JOptionPane.INFORMATION_MESSAGE)
267 .setDuration(Notification.TIME_LONG)
268 .show();
269 return;
270 }
271
272 Main.main.undoRedo.add(new SequenceCommand(tr("Create Circle"), cmds));
273 Main.map.repaint();
274 }
275
276 @Override
277 protected void updateEnabledState() {
278 if (getCurrentDataSet() == null) {
279 setEnabled(false);
280 } else {
281 updateEnabledState(getCurrentDataSet().getSelected());
282 }
283 }
284
285 @Override
286 protected void updateEnabledState(Collection<? extends OsmPrimitive> selection) {
287 setEnabled(selection != null && !selection.isEmpty());
288 }
289}
Note: See TracBrowser for help on using the repository browser.