M. Hohmeyer and S. Teller, Stabbing isothetic rectangles and boxes in O(n lg n) time, Computational Geometry Theory and Applications 4 (1992), 201--207. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Database and Display Algorithms for Interactive Visualization.. - Funkhouser (1993) (20 citations) (Correct)
.... (one from each of two portal edges parallel to the x, y, and z axes) Hohmeyer and Teller have implemented a procedure to find sightlines through axial portal sequences, or determine that no such sightline exists, 28 in O(n log n) time, where n is the number of portals in the sequence [31]. Amenta has proposed an O(n) solution for this problem [4] although it has not yet been implemented. We construct the cell to cell and cell to object visibility for the source cell during the depth first search. We define the cell to cell visibility for cell C to be the set of cells possibly ....
Hohmeyer, Michael E., and Seth J. Teller. Stabbing Isothetic Rectangles and Boxes in O(n lg n) Time. Technical Report UCB/CSD 91/634, Computer Science Department, U.C. Berkeley, 1991.
Stabbing Oriented Convex Polygons in Randomized O(n²) Time - Teller, Hohmeyer (1994) (2 citations) Self-citation (Hohmeyer Teller) (Correct)
....a stabbing line in O(g 2 n 2 lg n) time if one exists [8] When g is O(n) this time bound is the same as that due to Avis and Wenger. For the case of input polygons consisting only of isothetic (axis aligned) rectangles, Hohmeyer and Teller proposed an O(n lg n) time stabbing line algorithm [5]. Amenta improved this with a randomized linear time algorithm [1] Finally, 1991 Mathematics Subject Classification. 51M30, 68U05; 51A45, 51M20, 52A20, 52A40. The first author gratefully acknowledges the support of Silicon Graphics, Inc. c fl0000 American Mathematical Society 0000 0000 00 1.00 ....
M. Hohmeyer and S. Teller, Stabbing isothetic rectangles and boxes in O(n lg n) time, Computational Geometry Theory and Applications 4 (1992), 201--207.
The UC Berkeley System for Interactive.. - Funkhouser.. (1996) (8 citations) Self-citation (Teller) (Correct)
.... constraints (one from each of two portal edges parallel to the x, y, and z axes) Hohmeyer and Teller have implemented a procedure to find sightlines through axial portal sequences, or determine that no such sightline exists, in O(n log n) time, where n is the number of portals in the sequence [21]. Amenta has proposed an O(n) solution for this problem [3] although it has not yet been implemented. During the depth first search for the source cell C, we construct its cell to cell and cell toobject visibilities i.e. the sets of cells and objects, respectively, that are potentially ....
Hohmeyer, Michael E., and Seth J. Teller. Stabbing Isothetic Rectangles and Boxes in O(n lg n) Time. Technical Report UCB/CSD 91/634, Computer Science Department, U.C. Berkeley, 1991.
Visibility Preprocessing For Interactive Walkthroughs - Teller, Sequin (1991) (157 citations) Self-citation (Teller) (Correct)
....in order to explore the more numerous portals. In either event, sightlines are found by stabbing oriented rectangle sequences (Figure 12) in analogy to the two dimensional case. To accomplish this, we have developed and implemented a novel algorithm that determines sightlines through rectangles [13]. Briefly, the algorithm operates in a dual space in which the problem reduces to performing a linear number of convex polygon polygon intersections, each requiring logarithmic time [7] The algorithm finds a stabbing line through n oriented, axis aligned rectangles, or determines that no such ....
Michael E. Hohmeyer and Seth Teller. Stabbing isothetic rectangles and boxes in O(n lg n) time. Technical Report UCB/CSD 91/634, CS Department, UC Berkeley, 1991.
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