Mark Berg, Marc van Kreveld, Mark de Overmars, and Otfried Schwarzkopf. Computational Geometry by Example. Unpublished, draft 0.1 edition, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms for Computing Intersection and Union of.. - Cazals, Ramkumar (1997) (Correct)
....by S T those valid only for the input T . Our results are three fold. Firstly, we pre process the toleranced polygons to enable e#cient computation of the union or intersection for a query instance of tolerance values. The pre processing results are stored in a interval tree like data structure ([17, 5]) from which an instance of the intersection or union is computed in time O( n m) log S k # k log k) where k is the number of vertices of the union or 2 intersection and k # is the cardinality of a super set of the output vertices, with k # k # # S . This term k # causes the ....
....is found. To get the ordering from left to right, we just have to sort the n m left most and right most points. Now, for a given abscissa x, we need to know which are the other edges in the y range of the edge processed at this abscissa. This can be done using the interval tree data structure of [17, 5]. A precise analysis should however be performed to state a precise complexity for this Bentley Ottman sweep applied to trapezoids. But this is not that important since this step is a pre processing. 3 Selection of relevant intersections 3.1 Selecting a subset of events Let T = r 1 , r ....
[Article contains additional citation context not shown here]
M. de Berg et al. Computational geometry by example. Stanford University Press, draft version, 1996.
Multiple Destination Bin Packing - Verweij (1996) (Correct)
....print a front represented using the data structure. 4.1 The Data Structure We use a standard edge representation for connected two dimensional graphs called doubly connected edge list (dcel) to represent the front of a three dimensional packing. The same structure is described by de Berg et al. BKOS94, Chapter 2.2] We extend it to contain the data of the already placed boxes similar as described for the two dimensional case. In the front of a packing, we distinguish vertices, edges and cells. The cells are the two dimensional regions against (and on top of) which boxes can be placed. A cell ....
M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational geometry by example. Unpublished manuscript, 1994.
Texture Segmentation of SAR Images - Wang, Binford (1997) (1 citation) (Correct)
....connects boundary peaks to determine the closed boundary. This whole algorithm is shown in Figure 1 and described in the following three stages: ffl Stage 1: Delaunay Triangulation A triangulation of P is defined as a maximal planar subdivision to interpolate a terrain given P sample of points[4]. Given a set P of points in the plane, any locally and globally equiangular triangulation of P is the Delaunay triangulation of P . Therefore, the optimal approximation of a terrain can be achieved by the Delaunay triangulation. One example of the Delaunay triangulation is shown in Figure 3(d) ....
M. Berg et. al., "Computational Geometry by Example," Department of Computer Science, Utrecht University, the Netherlands, Chapter 9, pp.159-171, 1996.
Simple Traversal of a Subdivision Without Extra Storage - de Berg, van Kreveld.. (1996) (11 citations) Self-citation (De berg Van kreveld Overmars) (Correct)
....in 3dimensional space, and the traversal of a convex subdivision in 3 dimensional space. In all cases, no mark bits are required in the data structure. Some of our results have been obtained by Snoeyink [18] simultaneously. We present our algorithms using the doubly connected edge list structure [4, 14, 17], a standard data structure used in computational geometry that stores topology explicitly. This is not a restriction; simple adaptations to the algorithms can be done so that they apply to the quad edge structure [13] the fully topological network structure [3] the ARC INFO structure [15] ....
M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry by Example. 1996. manuscript.
Simple Traversal of a Subdivision Without Extra Storage - de Berg, van Oostrum.. (1997) (11 citations) Self-citation (De berg Overmars) (Correct)
....linear in the number of edges incident to c. We can prove that with the predecessor relationship defined as above, for every cell c in S there is exactly one path from c start to c. 2. 2 The algorithm To demonstrate the simplicity of our algorithm, we give the pseudo code using the notation of [2]: each edge is stored as two half edges with opposite orientation. They are called twins. If we let each (oriented) half edge be incident only to the face to its left, every face is bounded by a directed cycle of half edges. This cycle can be traversed by repeatedly going to the next half edge in ....
M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry by Example. manuscript, 1995.
Paper Summaries - Maniatis (2004) (Correct)
No context found.
Mark Berg, Marc van Kreveld, Mark de Overmars, and Otfried Schwarzkopf. Computational Geometry by Example. Unpublished, draft 0.1 edition, 1996.
Bucket-like Space Partitioning Data Structures with.. - Cazals And Puech (1997) (8 citations) (Correct)
No context found.
M. de Berg et al. Computational geometry by example. Stanford University Press, draft version, 1996.
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