T. Asano, M. Edahiro, H. Imai, and M. Iri. Practical use of bucketing techniques in computational geometry. In G.T. Toussaint, editor, Computational Geometry. Elsevier, 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....line segment S 1.3 Uniform grid, recursive grid and hierarchy of uniform grids We briefly review the notions of uniform grid, recursive grid and hierarchy of uniform grids depicted on figures 2 and 3. More details on bucket like space partitioning data structures can be found in [CDP95, A 94, AEII85, lBWY80, NH84] We suppose we are given a set O of n objects which can be polygons, implicit algebraic patches, whatever. We just require each object to be bounded and by its length d i we refer to its axis aligned bounding box diameter length. The reason why we need so few hypothesis on the data ....

T. Asano, M. Edahiro, H. Imai, and M. Iri. Practical use of bucketing techniques in computational geometry. In G.T. Toussaint, editor, Computational Geometry. Elsevier, 1985.

....analysis can be found in the papers and the performances tend to become rather poor with degenerate distributions of points, such as points belonging to a subset of lower dimension. The same remarks hold even when using sophisticated bucketing techniques such as the ones used by Asano et al. AEII85] A clear advantage of this algorithm however is that it is quite simple and allows insertions of new points in a dynamic way. This has motivated further investigations. A first idea [BT86] to improve the time complexity of the incremental algorithm consisted of keeping all the incremental ....

T. Asano, M. Edahiro, H. Imai, and M. Iri. Practical use of bucketing techniques in computational geometry. In G.T. Toussaint, editor, Computational Geometry, pages 153--196. North Holland, 1985.

....1,002 and 85,900 nodes. The original data set for usa13509 contains an odd number of points; for this instance, we follow the practice of Applegate and Cook [3] and drop the last point after sorting the x; y coordinates. The kanto instance is described in Asano, Edahiro, Imai, Iri, and Murota [4]. The two large VLSI instances were obtained from the VLSI design project at the Research Institute for Discrete Mathematics at the University of Bonn. For all instances other than kanto , the edge weights are defined Table 6: Test Instances Name Nodes Source pr1002 1,002 TSPLIB pcb3038 3,038 ....

T. Asano, M. Edahiro, H, Imai, M. Iri, and K. Murota, "Practical use of bucketing techniques in computational geometry", in: Computational Geometry (G.T. Toussaint, editor), North Holland, 1985, pages 153--195.

....[GS78] The quaternary incremental algorithm introduces a special bucketing technique, stored as a quaternary tree, to determine the order in which points must be inserted into the growing Voronoi diagram. An extensive experimental comparison of this algorithm with other algorithms is described in [AEIIM85] where it is established empirically that the algorithm runs in O(n) expected time, is faster than the other algorithms tested and for a thousand points runs in 0.25 seconds. It is conjectured that using this algorithm to compute the Delaunay triangulation in Ittner s approach will significantly ....

Asano, T., Edahiro, M., Imai, H., Iri, M. and Murota, K., "Practical use of bucketing techniques in computational geometry," in Computational Geometry, Ed., G. T. Toussaint, North-Holland, 1985, pp. 153-195.

.... include [Sedgewick, 1990, Preparata Shamos, 1985, Gonnet Baeza Yates, 1991, Mehlhorn, 1984] In particular, the tree like data structures are studied in [Omohumdro, 1987, Bentley, 1980, Bentley, 1990] and the bucket (or box) based methods in [Noga Allison, 1985, Devroye, 1986, Asano et al. 1985] Although considerable expertise is required to find and implement an optimal algorithm, we want to demonstrate in this paper that with relatively little effort a substantial factor in efficiency can be gained. The use of any intelligent algorithm can result in reducing CPU time (or increasing ....

....implementations of more general concepts. In this section we give some pointers to the literature which develops this further. The problem of finding nearest neighbors is related to a whole range of problems of computational geometry [Gonnet Baeza Yates, 1991, Mehlhorn, 1984, Bentley, 1990, Asano et al. 1985] problems in which a data base has to be built from a set of points in some geometric space. After that, certain queries have to be supported by this data base. One wants to devise algorithms optimal in terms of the size of storage and number of operations needed for a given task. The asymptotic ....

T. Asano, M. Edahiro, H. Imai, M. Iri and K. Murota, Practical Use of Bucketing Techniques in Computational Geometry, Computational Geometry, G. T. Toussaint, ed., Elsevier (1985).

No context found.

T. Asano, M. Edahiro, H. Imai, M. Iri, and K. Murota. Practical use of bucketing techniques in computational geometry. In G. T. Toussaint, editor, Computational Geometry, pages 153-- 195. 1985.

No context found.

T. Asano, M. Edahiro, H. Imai, M. Iri, and K. Murota. Practical use of bucketing techniques in computational geometry. In G. T. Toussaint, editor, Computational Geometry, pages 153--195. North-Holland, Amsterdam, Netherlands, 1985.

No context found.

Ta. Asano, M. Edahiro, H. Imai, M. Iri, and K. Murota. Practical use of bucketing techniques in computational geometry. In G. T. Toussaint, editor, Computational Geometry, pages 153--195. North-Holland, Amsterdam, Netherlands, 1985.

No context found.

T. Asano, M. Edahiro, H. Imai, M. Iri, and K. Murota. Practical use of bucketing techniques in computational geometry. In G.T. Toussaint, editor, Computational Geometry, pages 153--195. North-Holland, Amsterdam, The Netherlands, 1985.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC