| 000 | 07247nam a2201225Ia 4500 | ||
|---|---|---|---|
| 000 | 05081ntm a2200205 i 4500 | ||
| 001 | 76163 | ||
| 003 | 0 | ||
| 005 | 20250920163922.0 | ||
| 008 | 190206n 000 0 eng d | ||
| 010 |
_z _z _o _a _b |
||
| 015 |
_22 _a |
||
| 016 |
_2 _2 _a _z |
||
| 020 |
_e _e _a _b _z _c _q _x |
||
| 022 |
_y _y _l _a2 |
||
| 024 |
_2 _2 _d _c _a _q |
||
| 028 |
_a _a _b |
||
| 029 |
_a _a _b |
||
| 032 |
_a _a _b |
||
| 035 |
_a _a _b _z _c _q |
||
| 037 |
_n _n _c _a _b |
||
| 040 |
_e _erda _a _d _b _c |
||
| 041 |
_e _e _a _b _g _h _r |
||
| 043 |
_a _a _b |
||
| 045 |
_b _b _a |
||
| 050 |
_a _a _d _b2 _c0 |
||
| 051 |
_c _c _a _b |
||
| 055 |
_a _a _b |
||
| 060 |
_a _a _b |
||
| 070 |
_a _a _b |
||
| 072 |
_2 _2 _d _a _x |
||
| 082 |
_a _a _d _b2 _c |
||
| 084 |
_2 _2 _a |
||
| 086 |
_2 _2 _a |
||
| 090 |
_a _a _m _b _q |
||
| 092 |
_f _f _a _b |
||
| 096 |
_a _a _b |
||
| 097 |
_a _a _b |
||
| 100 |
_e _e _aJhomar A. Janapin and Denise O. Lumangaya. _d _b4 _u _c0 _q16 |
||
| 110 |
_e _e _a _d _b _n _c _k |
||
| 111 |
_a _a _d _b _n _c |
||
| 130 |
_s _s _a _p _f _l _k |
||
| 210 |
_a _a _b |
||
| 222 |
_a _a _b |
||
| 240 |
_s _s _a _m _g _n _f _l _o _p _k |
||
| 245 | 0 |
_a _aAn Enhancement of the Ramer - Douglas - Peucker Algorithm applied in map path simplification _d _b _n _cJhomar A. Janapin and Denise O. Lumangaya. _h6 _p |
|
| 246 |
_a _a _b _n _i _f6 _p |
||
| 249 |
_i _i _a |
||
| 250 |
_6 _6 _a _b |
||
| 260 |
_e _e _a _b _f _c _g |
||
| 264 |
_3 _3 _a _d _b _c201646 |
||
| 300 |
_e _e _c28 cm. _a119 pp. _b |
||
| 310 |
_a _a _b |
||
| 321 |
_a _a _b |
||
| 336 |
_b _atext _2rdacontent |
||
| 337 |
_3 _30 _b _aunmediated _2rdamedia |
||
| 338 |
_3 _30 _b _avolume _2rdacarrier |
||
| 340 |
_2 _20 _g _n |
||
| 344 |
_2 _2 _a0 _b |
||
| 347 |
_2 _2 _a0 |
||
| 362 |
_a _a _b |
||
| 385 |
_m _m _a2 |
||
| 410 |
_t _t _b _a _v |
||
| 440 |
_p _p _a _x _v |
||
| 490 |
_a _a _x _v |
||
| 500 |
_a _aABSTRACT: The Ramer-Douglas-Peuker algorithm belongs to the polyline simplification algorithms, which main process is to reduce the number of points in a polyline and at the same time retaining its essential characteristics to keep its overall shape as much as possible. The researchers carefully studied and analyzed the algorithm, what it is about, what its purpose is, and how it basically works. Given a polyline, the algorithm works by first, selecting the initial point on the line, called the anchor, and the last point, defined as floater. These two pints are automatically kept to be part of the simplified polyline. A straight line, or the approximated line, is drawn to connect these two points and the perpendicular distances from this line segment to all the intervening vertices are calculated. Next, the computed distances of the vertices are then compared to a user-defined tolerance or epsilon. Points with distances that are lower than the value of the epsilon can be discarded and not to be selected as part of the simplified output. On the the other hand, if a specific point has a perpendicular distance greater than the tolerance, it is kept and selected as a new floating point. A new line segment is generated, defined by the anchor point and the new floating point. The offsets or the distances of vertices are recalculated and the line is repeatedly subdivided into polylines until the tolerance is met. When the set tolerance is achieved, the anchor is moved to the most recently selected floater. The algorithm recursively calls itself until the anchor point reaches the last point of the line. When the process is completed, a simplified polyline is generated consisting of all vertices selected and kept and is connected by a straight line. The researchers encountered three problems during the study. The first one is that the algorithm produces intersections. The objective for this problem is to be able to produce a more simplified polyline be removing the intersection in the output. As a solution, the researchers added a function that will detect intersections in the input and will eliminate them from the output by completely removing the point of intersection before the simplification process is executed. The second problem is the lack of the algorithm to deal with equidistant vertices from the approximated line. Having two or more vertices with the same distance (equidistant) from the initial approximated line, assuming that those vertices have the maximum distance and exceed the tolerance, the algorithm can produce multiple outputs depending on which of those equidistant vertices it chooses to add the simplification. To solve this problem, the researches added a function that detects the occurrence of equidistant points with the maximum distance and, if there had been any, outputs all possible solutions. The last problem is the algorithm's recursive property. Since the algorithm uses recursion, it is very prone to cause a stack overflow. The researchers converted the algorithm into a non-recursive, iterative algorithm as a solution. As a result, the newly enhanced algorithm barely produces intersections in the outputs, provides and displays all possible simplifications for an input polyline, if there are more than one, and is now safe from causing stack overflows. Since the Ramer-Douglas-Peucker Algorithm can be applied in various applications such as cartography and visual displays of geographic maps using Geographic Information Systems (GIS), which provide users the most up-to-date geodata and geoprocessing, the researchers decided to apply the enhanced algorithm into a Map Path Simplification Application, where in the system is connected to Bing Maps. Its main use is to find a route from one address to another, provide detailed directions for that specific route, and simplify it by eliminating some of the roads and landmarks provided in the current directions, leaving only the major ones. The researches highly recommend the developed system mainly for people who often rely on maps to know how to get from one place to another, programmers and developers who are interested in related topics about this study, and for future researchers.;Undergraduate Thesis (BS in Computer Studies major in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2016 _d _b _c56 |
||
| 504 |
_a _a _x |
||
| 505 |
_a _a _b _t _g _r |
||
| 506 |
_a _a5 |
||
| 510 |
_a _a _x |
||
| 520 |
_b _b _c _a _u |
||
| 521 |
_a _a _b |
||
| 533 |
_e _e _a _d _b _n _c |
||
| 540 |
_c _c _a5 |
||
| 542 |
_g _g _f |
||
| 546 |
_a _a _b |
||
| 583 |
_5 _5 _k _c _a _b |
||
| 590 |
_a _a _b |
||
| 600 |
_b _b _v _t _c2 _q _a _x0 _z _d _y |
||
| 610 |
_b _b _v _t2 _x _a _k0 _p _z _d6 _y |
||
| 611 |
_a _a _d _n2 _c0 _v |
||
| 630 |
_x _x _a _d _p20 _v |
||
| 648 |
_2 _2 _a |
||
| 650 |
_x _x _a _d _b _z _y20 _v |
||
| 651 |
_x _x _a _y20 _v _z |
||
| 655 |
_0 _0 _a _y2 _z |
||
| 700 |
_i _i _t _c _b _s1 _q _f _k40 _p _d _e _a _l _n6 |
||
| 710 |
_b _b _t _c _e _f _k40 _p _d5 _l _n6 _a |
||
| 711 |
_a _a _d _b _n _t _c |
||
| 730 |
_s _s _a _d _n _p _f _l _k |
||
| 740 |
_e _e _a _d _b _n _c6 |
||
| 753 |
_c _c _a |
||
| 767 |
_t _t _w |
||
| 770 |
_t _t _w _x |
||
| 773 |
_a _a _d _g _m _t _b _v _i _p |
||
| 775 |
_t _t _w _x |
||
| 776 |
_s _s _a _d _b _z _i _t _x _h _c _w |
||
| 780 |
_x _x _a _g _t _w |
||
| 785 |
_t _t _w _a _x |
||
| 787 |
_x _x _d _g _i _t _w |
||
| 800 |
_a _a _d _l _f _t0 _q _v |
||
| 810 |
_a _a _b _f _t _q _v |
||
| 830 |
_x _x _a _p _n _l0 _v |
||
| 942 |
_a _alcc _cBK |
||
| 999 |
_c10401 _d10401 |
||