Steven Fortune. Vertex-rounding a three-dimensional polyhedral subdivision. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 116125, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Robust Geometric Computation - Yap (1997) (19 citations) (Correct)
....line segments) But this may generate new intersections (derived hooks) and the cascaded e#ects must be carefully controlled. The grid model of Greene Yao has been taken up by several other authors [Hob99, GM95, GGHT97] Extension to higher dimensions is harder: there is a solution of Fortune [For98] in 3 dimension. Further developments include the numerically stable algorithms in [FM91] The interesting twist here is the use of pseudolines rather than polylines. Ho#mann, Hopcroft, and Karasick [HHK88] address the problem of intersecting polygons in a consistent way. Phrased in terms of our ....
Steven Fortune. Vertex-rounding a three-dimensional polyhedral subdivision. In Proc. ACM Symp. on Comp. Geometry, 1998.
Combinatorial Curve Reconstruction and the Efficient Exact.. - Funke (Correct)
.... So in practice, users either write their own routines to allow for filtering on construction level (which can be supported by tools like our EXPCOMP expression compiler [BFS98] or use rounding schemes after every construction to keep the numerical complexity and space requirements low, see [For99] for example. Note though, that these rounding schemes actually require a proof that they do not a#ect the final result considerably. These proofs are non trivial and usually cannot be generalized. So each application has to be considered separately. Both these problems we have actually ....
....write their own routines to allow for filtering on construction level (which can be supported by tools like EXPCOMP [BFS98] or use rounding 89 90 Chapter 4. Efficient Exact Geometric Computation schemes after every construction to keep the numerical complexity and space requirements low, see [For99] for example. Note though, that these rounding schemes actually require a proof that they do not a#ect the final result considerably. These proofs are non trivial and usually cannot be generalized. So each application has to be considered separately. In this Chapter we present a new kernel design ....
S. Fortune. Vertex-rounding a three-dimensional polyhedral subdivision. Discrete Comput. Geom., 22(4):593--618, 1999.
Iterated Snap Rounding - Halperin, Packer (2002) (Correct)
....of the topological properties maintained by SR. Goodrich et al. 8] improve the SR algorithms when many segments intersect in a pixel. Milenkovic presents a rounding scheme using shortest paths [14] Three dimensional rounding algorithms of a similar nature have also been suggested and studied [7], 8] 13] The rest of the paper is organized as follows. In the next section we show that in SR a vertex and a non incident edge of the rounded arrangement can be very close to one another. In Section 3 we describe the augmented procedure ISR, prove its main properties and outline an algorithm ....
S. Fortune. Vertex-rounding a three-dimensional polyhedral subdivision. Discrete Comput. Geom., 22(4):593-618, 1999.
Snap Rounding Revisited - Packer, Halperin (2001) (Correct)
....as elementary proofs of the topological properties maintained by SR. Goodrich et al. 2] improve the SR algorithms when many segments intersect in a pixel. Milenkovic presents a rounding scheme using shortest paths [8] Three dimensional rounding algorithms have also been suggested and studied [1, 2, 7]. 2 The Distance between a Vertex and a Non Incident Edge For an input segment u, we denote its rounded version by u 0 . Consider the two segments s; t displayed in Figure 2 before and after SR. We denote the right endpoint of s 0 by s 0 r . After rounding, t 0 penetrates the hot pixel ....
S. Fortune. Vertex-rounding a three-dimensional polyhedral subdivision. Discrete Comput. Geom., 22(4):593-618, 1999.
Rounding Voronoi diagram - Devillers, Gandoin (1998) (Correct)
No context found.
Steven Fortune. Vertex-rounding a three-dimensional polyhedral subdivision. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 116125, 1998.
Finite Precision Elementary Geometric Constructions - Devillers, Guigue (2002) (Correct)
No context found.
S. Fortune. Vertex-rounding a three-dimensional polyhedral subdivision. Discrete Comput. Geom., 22(4):593--618, 1999.
Variable-Precision Rendering - Hao, Varshney (2001) (1 citation) (Correct)
No context found.
S. Fortune. Vertex rounding a three-dimensional polyhedral subdivision. In Proceedings of the Fourteenth Annual Symposium on Computational Geometry, pages 116--125. ACM Press, June 1998.
Inner and Outer Rounding of Set Operations on Lattice.. - Devillers, Guigue (2003) (Correct)
No context found.
S. Fortune. Vertex-rounding a three-dimensional polyhedral subdivision. Discrete Comput. Geom., 22(4):593618, 1999.
Finite Precision Elementary Geometric Constructions - Devillers, Guigue (2002) (Correct)
No context found.
S. Fortune. Vertex-rounding a three-dimensional polyhedral subdivision. Discrete Comput. Geom., 22(4):593--618, 1999.
Controlled Perturbation for Arrangements of Polyhedral Surfaces - Raab, Halperin (2002) (12 citations) (Correct)
No context found.
S. Fortune. Vertex-rounding a three-dimensional polyhedral subdivision. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 116125, 1998.
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