F.P. Preparata and M.I. Shamos, Computational (leomerry, An Introduction, Springer-Verlag, 1985 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Scanline Algorithms on a Grid - Karlsson, Overmars (1986) (5 citations) (Correct)
....O(n u) storage. Proof: Soisalon Soininen and Wood [18] showed that the closure can be de termined by first computing the NE closure, through a left to right scan of the rectangles, followed by a right to left scan to get the SW closure of the result. We outline their algorithm as described in [17]. For each connected component, the boundary of its closure consists of two z monotonic staircase curves. A component is called active if it is intersected by the scanline. Thus, a component is active if and only if it contains at least one (active) rectangle intersecting the scanline. An active ....
F.P. Preparata and M.I. Shamos, Computational (leomerry, An Introduction, Springer-Verlag, 1985
Monte Carlo Approximation of Form Factors with Error Bounded a.. - Pellegrini (1997) (14 citations) (Correct)
....formulation that is, in principle, computable. The next step in our research hinges on the choice of coordinates of the lines so that the resulting concrete formulation for the form factor contains quantities that can be computed easily and efficiently using computation geometry techniques [PS85] In our case we use only orthogonal projections and the area of planar convex polygons, for this reason we refer to our method as the . This formulation involves an integral which is simpler than those previously known. We use Monte Carlo integration to approximate the value of the integral ....
....measure. These are important properties that we use to derive an exact bound on the variance of the integrand function and consequently a bound on the absolute error of the Monte Carlo integration. For the case of two polygon, the algorithmic techniques needed are standard and can be found in [PS85] For the case of many polygons, we use the vertical cylindrical decomposition of Mulmuley [Mul91] to compute efficiently the terms of the summations in the Monte Carlo approximation of the integral. Such data structures are built via plane sweep and dynamic maintenance of polygonal planar maps. ....
F.P. Preparata and M.I. Shamos. . Springer Verlag, 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