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

Last change on this file since 8850 was 8513, checked in by Don-vip, 9 years ago

checkstyle: blocks
  • Property svn:eol-style set to native
File size: 10.8 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.io.Serializable;
10import java.util.ArrayList;
11import java.util.Arrays;
12import java.util.Collection;
13import java.util.Collections;
14import java.util.Comparator;
15import java.util.LinkedList;
16import java.util.List;
17
18import javax.swing.JOptionPane;
19
20import org.openstreetmap.josm.Main;
21import org.openstreetmap.josm.command.AddCommand;
22import org.openstreetmap.josm.command.ChangeCommand;
23import org.openstreetmap.josm.command.Command;
24import org.openstreetmap.josm.command.SequenceCommand;
25import org.openstreetmap.josm.data.coor.EastNorth;
26import org.openstreetmap.josm.data.coor.LatLon;
27import org.openstreetmap.josm.data.osm.Node;
28import org.openstreetmap.josm.data.osm.OsmPrimitive;
29import org.openstreetmap.josm.data.osm.Way;
30import org.openstreetmap.josm.gui.Notification;
31import org.openstreetmap.josm.tools.Geometry;
32import org.openstreetmap.josm.tools.RightAndLefthandTraffic;
33import org.openstreetmap.josm.tools.Shortcut;
34
35/**
36 * - Create a new circle from two selected nodes or a way with 2 nodes which represent the diameter of the circle.
37 * - Create a new circle from three selected nodes--or a way with 3 nodes.
38 * - Useful for roundabouts
39 *
40 * Notes:
41 * * If a way is selected, it is changed. If nodes are selected a new way is created.
42 * So if you've got a way with nodes it makes a difference between running this on the way or the nodes!
43 * * The existing nodes are retained, and additional nodes are inserted regularly
44 * to achieve the desired number of nodes (`createcircle.nodecount`).
45 * BTW: Someone might want to implement projection corrections for this...
46 *
47 * @author Henry Loenwind
48 * @author Sebastian Masch
49 * @author Alain Delplanque
50 *
51 * @since 996
52 */
53public final class CreateCircleAction extends JosmAction {
54
55 /**
56 * Constructs a new {@code CreateCircleAction}.
57 */
58 public CreateCircleAction() {
59 super(tr("Create Circle"), "aligncircle", tr("Create a circle from three selected nodes."),
60 Shortcut.registerShortcut("tools:createcircle", tr("Tool: {0}", tr("Create Circle")),
61 KeyEvent.VK_O, Shortcut.SHIFT), true, "createcircle", true);
62 putValue("help", ht("/Action/CreateCircle"));
63 }
64
65 /**
66 * Distributes nodes according to the algorithm of election with largest remainder.
67 * @param angles Array of PolarNode ordered by increasing angles
68 * @param nodesCount Number of nodes to be distributed
69 * @return Array of number of nodes to put in each arc
70 */
71 private int[] distributeNodes(PolarNode[] angles, int nodesCount) {
72 int[] count = new int[angles.length];
73 double[] width = new double[angles.length];
74 double[] remainder = new double[angles.length];
75 for (int i = 0; i < angles.length; i++) {
76 width[i] = angles[(i+1) % angles.length].a - angles[i].a;
77 if (width[i] < 0)
78 width[i] += 2*Math.PI;
79 }
80 int assign = 0;
81 for (int i = 0; i < angles.length; i++) {
82 double part = width[i] / 2.0 / Math.PI * nodesCount;
83 count[i] = (int) Math.floor(part);
84 remainder[i] = part - count[i];
85 assign += count[i];
86 }
87 while (assign < nodesCount) {
88 int imax = 0;
89 for (int i = 1; i < angles.length; i++) {
90 if (remainder[i] > remainder[imax])
91 imax = i;
92 }
93 count[imax]++;
94 remainder[imax] = 0;
95 assign++;
96 }
97 return count;
98 }
99
100 /**
101 * Class designed to create a couple between a node and its angle relative to the center of the circle.
102 */
103 private static class PolarNode {
104 private double a;
105 private Node node;
106
107 PolarNode(EastNorth center, Node n) {
108 EastNorth pt = n.getEastNorth();
109 this.a = Math.atan2(pt.north() - center.north(), pt.east() - center.east());
110 this.node = n;
111 }
112 }
113
114 /**
115 * Comparator used to order PolarNode relative to their angle.
116 */
117 private static class PolarNodeComparator implements Comparator<PolarNode>, Serializable {
118 private static final long serialVersionUID = 1L;
119
120 @Override
121 public int compare(PolarNode pc1, PolarNode pc2) {
122 return Double.compare(pc1.a, pc2.a);
123 }
124 }
125
126 @Override
127 public void actionPerformed(ActionEvent e) {
128 if (!isEnabled())
129 return;
130
131 int numberOfNodesInCircle = Main.pref.getInteger("createcircle.nodecount", 16);
132 if (numberOfNodesInCircle < 1) {
133 numberOfNodesInCircle = 1;
134 } else if (numberOfNodesInCircle > 100) {
135 numberOfNodesInCircle = 100;
136 }
137
138 Collection<OsmPrimitive> sel = getCurrentDataSet().getSelected();
139 List<Node> nodes = OsmPrimitive.getFilteredList(sel, Node.class);
140 List<Way> ways = OsmPrimitive.getFilteredList(sel, Way.class);
141
142 Way existingWay = null;
143
144 // special case if no single nodes are selected and exactly one way is:
145 // then use the way's nodes
146 if (nodes.isEmpty() && (ways.size() == 1)) {
147 existingWay = ways.get(0);
148 for (Node n : existingWay.getNodes()) {
149 if (!nodes.contains(n)) {
150 nodes.add(n);
151 }
152 }
153 }
154
155 if (nodes.size() < 2 || nodes.size() > 3) {
156 new Notification(
157 tr("Please select exactly two or three nodes or one way with exactly two or three nodes."))
158 .setIcon(JOptionPane.INFORMATION_MESSAGE)
159 .setDuration(Notification.TIME_LONG)
160 .show();
161 return;
162 }
163
164 // now we can start doing things to OSM data
165 Collection<Command> cmds = new LinkedList<>();
166 EastNorth center = null;
167
168 if (nodes.size() == 2) {
169 // diameter: two single nodes needed or a way with two nodes
170 Node n1 = nodes.get(0);
171 double x1 = n1.getEastNorth().east();
172 double y1 = n1.getEastNorth().north();
173 Node n2 = nodes.get(1);
174 double x2 = n2.getEastNorth().east();
175 double y2 = n2.getEastNorth().north();
176
177 // calculate the center (xc/yc)
178 double xc = 0.5 * (x1 + x2);
179 double yc = 0.5 * (y1 + y2);
180 center = new EastNorth(xc, yc);
181 } else {
182 // triangle: three single nodes needed or a way with three nodes
183 center = Geometry.getCenter(nodes);
184 if (center == null) {
185 notifyNodesNotOnCircle();
186 return;
187 }
188 }
189
190 // calculate the radius (r)
191 EastNorth n1 = nodes.get(0).getEastNorth();
192 double r = Math.sqrt(Math.pow(center.east()-n1.east(), 2) +
193 Math.pow(center.north()-n1.north(), 2));
194
195 // Order nodes by angle
196 PolarNode[] angles = new PolarNode[nodes.size()];
197 for (int i = 0; i < nodes.size(); i++) {
198 angles[i] = new PolarNode(center, nodes.get(i));
199 }
200 Arrays.sort(angles, new PolarNodeComparator());
201 int[] count = distributeNodes(angles,
202 numberOfNodesInCircle >= nodes.size() ? numberOfNodesInCircle - nodes.size() : 0);
203
204 // build a way for the circle
205 List<Node> nodesToAdd = new ArrayList<>();
206 for (int i = 0; i < nodes.size(); i++) {
207 nodesToAdd.add(angles[i].node);
208 double delta = angles[(i+1) % nodes.size()].a - angles[i].a;
209 if (delta < 0)
210 delta += 2*Math.PI;
211 for (int j = 0; j < count[i]; j++) {
212 double alpha = angles[i].a + (j+1)*delta/(count[i]+1);
213 double x = center.east() + r*Math.cos(alpha);
214 double y = center.north() + r*Math.sin(alpha);
215 LatLon ll = Main.getProjection().eastNorth2latlon(new EastNorth(x, y));
216 if (ll.isOutSideWorld()) {
217 notifyNodesNotOnCircle();
218 return;
219 }
220 Node n = new Node(ll);
221 nodesToAdd.add(n);
222 cmds.add(new AddCommand(n));
223 }
224 }
225 nodesToAdd.add(nodesToAdd.get(0)); // close the circle
226 if (existingWay != null && existingWay.getNodesCount() >= 3) {
227 nodesToAdd = orderNodesByWay(nodesToAdd, existingWay);
228 } else {
229 nodesToAdd = orderNodesByTrafficHand(nodesToAdd);
230 }
231 if (existingWay == null) {
232 Way newWay = new Way();
233 newWay.setNodes(nodesToAdd);
234 cmds.add(new AddCommand(newWay));
235 } else {
236 Way newWay = new Way(existingWay);
237 newWay.setNodes(nodesToAdd);
238 cmds.add(new ChangeCommand(existingWay, newWay));
239 }
240
241 Main.main.undoRedo.add(new SequenceCommand(tr("Create Circle"), cmds));
242 Main.map.repaint();
243 }
244
245 /**
246 * Order nodes according to left/right hand traffic.
247 * @param nodes Nodes list to be ordered.
248 * @return Modified nodes list ordered according hand traffic.
249 */
250 private List<Node> orderNodesByTrafficHand(List<Node> nodes) {
251 boolean rightHandTraffic = true;
252 for (Node n: nodes) {
253 if (!RightAndLefthandTraffic.isRightHandTraffic(n.getCoor())) {
254 rightHandTraffic = false;
255 break;
256 }
257 }
258 if (rightHandTraffic == Geometry.isClockwise(nodes)) {
259 Collections.reverse(nodes);
260 }
261 return nodes;
262 }
263
264 /**
265 * Order nodes according to way direction.
266 * @param nodes Nodes list to be ordered.
267 * @param way Way used to determine direction.
268 * @return Modified nodes list with same direction as way.
269 */
270 private List<Node> orderNodesByWay(List<Node> nodes, Way way) {
271 List<Node> wayNodes = way.getNodes();
272 if (!way.isClosed()) {
273 wayNodes.add(wayNodes.get(0));
274 }
275 if (Geometry.isClockwise(wayNodes) != Geometry.isClockwise(nodes)) {
276 Collections.reverse(nodes);
277 }
278 return nodes;
279 }
280
281 private static void notifyNodesNotOnCircle() {
282 new Notification(
283 tr("Those nodes are not in a circle. Aborting."))
284 .setIcon(JOptionPane.WARNING_MESSAGE)
285 .show();
286 }
287
288 @Override
289 protected void updateEnabledState() {
290 if (getCurrentDataSet() == null) {
291 setEnabled(false);
292 } else {
293 updateEnabledState(getCurrentDataSet().getSelected());
294 }
295 }
296
297 @Override
298 protected void updateEnabledState(Collection<? extends OsmPrimitive> selection) {
299 setEnabled(selection != null && !selection.isEmpty());
300 }
301}
Note: See TracBrowser for help on using the repository browser.