| Main Page | Introduction | History | Preliminary | Algorithms | Applet | References |

                                

____________________________________________________________________________________

 

Definition

References & Links

[1]  S. Langerman. On the Complexity of Halfspace Area Queries. In Discrete and Computational Geometry, to appear.

[2]  S. Langerman and W. Steiger. Computing a maximal depth point in the plane. In Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG 2000), 2000.

[3] F.Contreras-Alcala. Cutting polygons and a problem on illumination of stages. M.Sc thesis, Dept. Comp. Sci. University of Ottawa, Ottawa,ON,Canada, 1998.

[4] J. O'Rourke, Computational Geometry in C, Second Edition, Cambridge University Press, 1998.
[5] Palph P.Boland and J. Urrutia. Polygon Area Problems. 12th Canadian Conference on Coputational
Geometry .

[6]F.Contreras-Alcala and J. Urrutia. On measuring areas of polygons. conference CCCG'98.

[7]A. Gittleman, History of Mathematics, Charles E. Merrill Publishing Company , 1975.

[8]J. L,Coolidge, A History of Geometrical  Methods, Dover Publications, INC. New York, 1963.

 

__________________________________________________________________________________

                                

| Main Page | Introduction | History | Preliminary | Algorithms | Applet | References |