Abstract
Given a configuration C of geometric objects in R 2 (called the input configuration), a target configuration T of geometric objects in R 1, and a class S of allowable sectioning lines we consider in this paper many variations on the following problem: ‘Is there a line S∈S such that the section S∩C is equivalent by rigid motion to the target T?’
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amenta, N. and Ziegler, G.: Shadows and slices of polytopes, In: Proc. 12th ACM Sympos. Comput. Geo., 1996, pp. 10–19.
Amenta, N. and Ziegler, G.: Deformed products and maximal shadows of polytopes, In: B. Chazelle, J. E. Goodman and R. Pollack (eds), Advances in Discrete and Computational Geometry, Contemp. Math. 223, Amer. Math. Soc., Providence, 1999, pp. 57-90.
Avis, D., Bose, P., Shermer, T., Snoeyink, J., Toussaint, G. and Zhu, B.: On the sectional area of convex polytopes, In: Proc. 12th ACM Sympos. Comput. Geom., 1996.
Barequet, G. and Sharir, M.: Piecewise linear interpolation between polygonal slices, In: Proc. 10th ACM Sympos. Comput. Geom., 1994, pp. 93–102.
de Berg, M., van Kreveld, M., Overmars, M. and Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, Springer-Verlag, New York, 1997.
Boissonnat, J. D.: Shape reconstruction form planar cross sections, Comput. Vision, Graphics Image Process. 44 (1988), 1–29.
Bose, P., Gómez, F., Ramos, P. and Toussaint, G.: Drawing nice projections of objects in space, In: Proc. of Graph Drawing'95, Lecture Notes in Comput. Sci. 1027, Springer-Verlag, New York, 1996, pp. 52–63.
Bose, P., Hurtado, F., Meijer, H., Ramaswami, S., Rappaport, D., Sacristán, V., Shermer, T. and Toussaint, G.: Finding specified sections of arrangements: 3D results, Manuscript in preparation.
Burger, T., Gritzmann, P. and Klee, V.: Polytope projection and projection polytopes, TR No. 95-14, Dept. Math., Trier University.
Chazelle, B., Edelsbrunner, H. and Guibas, L.: The complexity of cutting complexes, Discrete Comput. Geom. 4 (1989), 139–182.
Deans, S.: The Radon Transform and Some of Its Applications, Wiley, New York, 1983.
Dobkin, D. P., Edelsbrunner, H. and Yap, C. K.: Probing convex polytopes, In: Proc. 18th ACM Sympos. Theory Comput., 1986, pp. 424–432.
Edelsbrunner, H.: Algorithms in Combinatorial Geometry, EATCS Monogr. Theoret. Comput. Sci. 10, Springer-Verlag, New York, 1987.
Edelsbrunner, H. and Skiena, S.: Probing convex polygons with X-rays, SIAM J. Comput. 17 (1988), 870–882.
Gardner, R. J.: Geometric tomography, Notices Amer. Math. Soc. 42(4) (1995), 422–429.
Gardner, R. J.: Geometric Tomography, Encyclop. Math. Appl. 58, Cambridge Univ. Press, New York, 1995.
Gardner, R. J. and Gritzmann, P.: Successive determination and verification of polytopes by their X-rays, J. London Math. Soc. (2) 50 (1994), 375–391.
Gardner, R. J. and Gritzmann, P.: Determination of finite sets by X-rays, In: Abstracts 12th European Workshop on Comput. Geom., Münster, 1996, pp. 71–72.
Gardner, R. J. and McMullen, P.: On Hammer's X-ray problem, J. London Math. Soc. (2) 21 (1980), 171–175.
Gitlin, C., O'Rourke, J. and Subramannian, V.: On reconstructing polyhedra from parallel slices, Internat. J. Comput. Geom. Appl. 6 (1996), 103–122.
Gómez, F., Hurtado, F. and Toussaint, G.: Proyecciones de calidad y reconstrucción de conjuntos (in Spanish), In: Proc. Congreso Espanol de Informática Gráfica, 1996, pp. 18–27.
Herman, G.: Image Reconstruction from Projections: The Fundamentals of Computerized Tomography, Academic Press, New York, 1980.
Herman, G. T., Louis, A. K. and Natterer, F. (eds): Mathematical Methods in Tomography, Lecture Notes in Math. 1497, Springer-Verlag, New York, 1990.
Herman, G. T. and Natterer, F. (eds): Mathematical Aspects of Computerized Tomography, Springer-Verlag, Berlin, 1981.
Herman, G., Tuy, H., Langenberg, K. and Sabatier, P.: Basic Methods of Tomography and Inverse Problems, Adam Hilger, Bristol, 1987.
Lang, S. L.: Algebra, Addison-Wesley, Reading, MA, 1967.
Lee, D. T. and Wu, Y.: Geometric complexity of some location problems, Algorithmica 1 (1986), 193–211.
Li, S. Y. R.: Reconstruction of polygons from projections, Inf. Proc. Lett. 28 (1988), 235–240.
Lindenbaum, M. and Bruckstein, A.: Reconstruction of polygonal sets by constrained and unconstrained double probing, Ann. Math. Artif. Intell., to be published.
McKenna, M. and Seidel, R.: Finding the optimal shadows of a convex polytope, In: Proc. ACM Sympos. Comput. Geom., 1985, pp. 24–28.
Meijer, H. and Skiena, S.: Reconstructing polygons from x-Rays, In: Proc. 5th Canadian Conf. Comput. Geom., 1993, pp. 381–386.
Natterer, F.: The Mathematics of Computerized Tomography, Wiley, Chichester, 1986.
Ponce, J. and Faverjon, B.: On computing three-finger force-closure grasps of polygonal objects, IEEE Trans. Robotics Automat. 11(6) (1995).
Ponce, J., Sullivan, S., Sudsang, A., Boissonnat, J. D. and Merlet, J. P.: On computing four-finger equilibrium and force-closure grasps of polyhedral objects, Int. J. Robot. Res. 16(1) (1997), 13–35.
Skiena, S.: Interactive reconstruction via geometric probing, Proc. IEEE 80 (1992), 1364–1383.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bose, P., Hurtado, F., Meijer, H. et al. Finding Specified Sections of Arrangements: 2D Results. Journal of Mathematical Modelling and Algorithms 1, 3–16 (2002). https://doi.org/10.1023/A:1015648719133
Issue Date:
DOI: https://doi.org/10.1023/A:1015648719133