001// License: GPL. For details, see LICENSE file.
002package org.openstreetmap.josm.actions;
003
004import static org.openstreetmap.josm.gui.help.HelpUtil.ht;
005import static org.openstreetmap.josm.tools.I18n.tr;
006import static org.openstreetmap.josm.tools.I18n.trn;
007
008import java.awt.event.ActionEvent;
009import java.awt.event.KeyEvent;
010import java.util.ArrayList;
011import java.util.Collection;
012import java.util.Collections;
013import java.util.HashSet;
014import java.util.LinkedList;
015import java.util.List;
016import java.util.Set;
017
018import javax.swing.JOptionPane;
019
020import org.openstreetmap.josm.Main;
021import org.openstreetmap.josm.command.ChangeCommand;
022import org.openstreetmap.josm.command.Command;
023import org.openstreetmap.josm.command.DeleteCommand;
024import org.openstreetmap.josm.command.SequenceCommand;
025import org.openstreetmap.josm.data.osm.DataSet;
026import org.openstreetmap.josm.data.osm.Node;
027import org.openstreetmap.josm.data.osm.OsmPrimitive;
028import org.openstreetmap.josm.data.osm.Way;
029import org.openstreetmap.josm.data.projection.Ellipsoid;
030import org.openstreetmap.josm.gui.HelpAwareOptionPane;
031import org.openstreetmap.josm.gui.HelpAwareOptionPane.ButtonSpec;
032import org.openstreetmap.josm.gui.Notification;
033import org.openstreetmap.josm.tools.ImageProvider;
034import org.openstreetmap.josm.tools.Shortcut;
035
036/**
037 * Delete unnecessary nodes from a way
038 * @since 2575
039 */
040public class SimplifyWayAction extends JosmAction {
041
042    /**
043     * Constructs a new {@code SimplifyWayAction}.
044     */
045    public SimplifyWayAction() {
046        super(tr("Simplify Way"), "simplify", tr("Delete unnecessary nodes from a way."),
047                Shortcut.registerShortcut("tools:simplify", tr("Tool: {0}", tr("Simplify Way")), KeyEvent.VK_Y, Shortcut.SHIFT), true);
048        putValue("help", ht("/Action/SimplifyWay"));
049    }
050
051    protected boolean confirmWayWithNodesOutsideBoundingBox(List<? extends OsmPrimitive> primitives) {
052        return DeleteCommand.checkAndConfirmOutlyingDelete(primitives, null);
053    }
054
055    protected void alertSelectAtLeastOneWay() {
056        new Notification(
057                tr("Please select at least one way to simplify."))
058                .setIcon(JOptionPane.WARNING_MESSAGE)
059                .setDuration(Notification.TIME_SHORT)
060                .setHelpTopic(ht("/Action/SimplifyWay#SelectAWayToSimplify"))
061                .show();
062    }
063
064    protected boolean confirmSimplifyManyWays(int numWays) {
065        ButtonSpec[] options = new ButtonSpec[] {
066                new ButtonSpec(
067                        tr("Yes"),
068                        ImageProvider.get("ok"),
069                        tr("Simplify all selected ways"),
070                        null
071                        ),
072                        new ButtonSpec(
073                                tr("Cancel"),
074                                ImageProvider.get("cancel"),
075                                tr("Cancel operation"),
076                                null
077                                )
078        };
079        return 0 == HelpAwareOptionPane.showOptionDialog(
080                Main.parent,
081                tr(
082                        "The selection contains {0} ways. Are you sure you want to simplify them all?",
083                        numWays
084                        ),
085                        tr("Simplify ways?"),
086                        JOptionPane.WARNING_MESSAGE,
087                        null, // no special icon
088                        options,
089                        options[0],
090                        ht("/Action/SimplifyWay#ConfirmSimplifyAll")
091                );
092    }
093
094    @Override
095    public void actionPerformed(ActionEvent e) {
096        DataSet ds = getCurrentDataSet();
097        ds.beginUpdate();
098        try {
099            List<Way> ways = OsmPrimitive.getFilteredList(ds.getSelected(), Way.class);
100            if (ways.isEmpty()) {
101                alertSelectAtLeastOneWay();
102                return;
103            } else if (!confirmWayWithNodesOutsideBoundingBox(ways)) {
104                return;
105            } else if (ways.size() > 10 && !confirmSimplifyManyWays(ways.size())) {
106                return;
107            }
108
109            Collection<Command> allCommands = new LinkedList<>();
110            for (Way way: ways) {
111                SequenceCommand simplifyCommand = simplifyWay(way);
112                if (simplifyCommand == null) {
113                    continue;
114                }
115                allCommands.add(simplifyCommand);
116            }
117            if (allCommands.isEmpty()) return;
118            SequenceCommand rootCommand = new SequenceCommand(
119                    trn("Simplify {0} way", "Simplify {0} ways", allCommands.size(), allCommands.size()),
120                    allCommands
121                    );
122            Main.main.undoRedo.add(rootCommand);
123        } finally {
124            ds.endUpdate();
125        }
126        Main.map.repaint();
127    }
128
129    /**
130     * Replies true if <code>node</code> is a required node which can't be removed
131     * in order to simplify the way.
132     *
133     * @param way the way to be simplified
134     * @param node the node to check
135     * @return true if <code>node</code> is a required node which can't be removed
136     * in order to simplify the way.
137     */
138    protected boolean isRequiredNode(Way way, Node node) {
139        boolean isRequired =  Collections.frequency(way.getNodes(), node) > 1;
140        if (!isRequired) {
141            List<OsmPrimitive> parents = new LinkedList<>();
142            parents.addAll(node.getReferrers());
143            parents.remove(way);
144            isRequired = !parents.isEmpty();
145        }
146        if (!isRequired) {
147            isRequired = node.isTagged();
148        }
149        return isRequired;
150    }
151
152    /**
153     * Simplifies a way with default threshold (read from preferences).
154     *
155     * @param w the way to simplify
156     * @return The sequence of commands to run
157     * @since 6411
158     */
159    public final SequenceCommand simplifyWay(Way w) {
160        return simplifyWay(w, Main.pref.getDouble("simplify-way.max-error", 3.0));
161    }
162
163    /**
164     * Simplifies a way with a given threshold.
165     *
166     * @param w the way to simplify
167     * @param threshold the max error threshold
168     * @return The sequence of commands to run
169     * @since 6411
170     */
171    public SequenceCommand simplifyWay(Way w, double threshold) {
172        int lower = 0;
173        int i = 0;
174        List<Node> newNodes = new ArrayList<>(w.getNodesCount());
175        while (i < w.getNodesCount()) {
176            if (isRequiredNode(w, w.getNode(i))) {
177                // copy a required node to the list of new nodes. Simplify not possible
178                newNodes.add(w.getNode(i));
179                i++;
180                lower++;
181                continue;
182            }
183            i++;
184            // find the longest sequence of not required nodes ...
185            while (i < w.getNodesCount() && !isRequiredNode(w, w.getNode(i))) {
186                i++;
187            }
188            // ... and simplify them
189            buildSimplifiedNodeList(w.getNodes(), lower, Math.min(w.getNodesCount()-1, i), threshold, newNodes);
190            lower = i;
191            i++;
192        }
193
194        Set<Node> delNodes = new HashSet<>();
195        delNodes.addAll(w.getNodes());
196        delNodes.removeAll(newNodes);
197
198        if (delNodes.isEmpty()) return null;
199
200        Collection<Command> cmds = new LinkedList<>();
201        Way newWay = new Way(w);
202        newWay.setNodes(newNodes);
203        cmds.add(new ChangeCommand(w, newWay));
204        cmds.add(new DeleteCommand(delNodes));
205        w.getDataSet().clearSelection(delNodes);
206        return new SequenceCommand(
207                trn("Simplify Way (remove {0} node)", "Simplify Way (remove {0} nodes)", delNodes.size(), delNodes.size()), cmds);
208    }
209
210    /**
211     * Builds the simplified list of nodes for a way segment given by a lower index <code>from</code>
212     * and an upper index <code>to</code>
213     *
214     * @param wnew the way to simplify
215     * @param from the lower index
216     * @param to the upper index
217     * @param threshold the max error threshold
218     * @param simplifiedNodes list that will contain resulting nodes
219     */
220    protected void buildSimplifiedNodeList(List<Node> wnew, int from, int to, double threshold, List<Node> simplifiedNodes) {
221
222        Node fromN = wnew.get(from);
223        Node toN = wnew.get(to);
224
225        // Get max xte
226        int imax = -1;
227        double xtemax = 0;
228        for (int i = from + 1; i < to; i++) {
229            Node n = wnew.get(i);
230            double xte = Math.abs(Ellipsoid.WGS84.a
231                    * xtd(fromN.getCoor().lat() * Math.PI / 180, fromN.getCoor().lon() * Math.PI / 180, toN.getCoor().lat() * Math.PI
232                            / 180, toN.getCoor().lon() * Math.PI / 180, n.getCoor().lat() * Math.PI / 180, n.getCoor().lon() * Math.PI
233                            / 180));
234            if (xte > xtemax) {
235                xtemax = xte;
236                imax = i;
237            }
238        }
239
240        if (imax != -1 && xtemax >= threshold) {
241            // Segment cannot be simplified - try shorter segments
242            buildSimplifiedNodeList(wnew, from, imax, threshold, simplifiedNodes);
243            buildSimplifiedNodeList(wnew, imax, to, threshold, simplifiedNodes);
244        } else {
245            // Simplify segment
246            if (simplifiedNodes.isEmpty() || simplifiedNodes.get(simplifiedNodes.size()-1) != fromN) {
247                simplifiedNodes.add(fromN);
248            }
249            if (fromN != toN) {
250                simplifiedNodes.add(toN);
251            }
252        }
253    }
254
255    /* From Aviaton Formulary v1.3
256     * http://williams.best.vwh.net/avform.htm
257     */
258    public static double dist(double lat1, double lon1, double lat2, double lon2) {
259        return 2 * Math.asin(Math.sqrt(Math.pow(Math.sin((lat1 - lat2) / 2), 2) + Math.cos(lat1) * Math.cos(lat2)
260                * Math.pow(Math.sin((lon1 - lon2) / 2), 2)));
261    }
262
263    public static double course(double lat1, double lon1, double lat2, double lon2) {
264        return Math.atan2(Math.sin(lon1 - lon2) * Math.cos(lat2), Math.cos(lat1) * Math.sin(lat2) - Math.sin(lat1)
265                * Math.cos(lat2) * Math.cos(lon1 - lon2))
266                % (2 * Math.PI);
267    }
268
269    public static double xtd(double lat1, double lon1, double lat2, double lon2, double lat3, double lon3) {
270        double distAD = dist(lat1, lon1, lat3, lon3);
271        double crsAD = course(lat1, lon1, lat3, lon3);
272        double crsAB = course(lat1, lon1, lat2, lon2);
273        return Math.asin(Math.sin(distAD) * Math.sin(crsAD - crsAB));
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}