Théorie et applications des équipollences, par C. A. Laisant.

16 4 146 ~~SECONDE PAIRTIE. - CHTAPITRE V. CHAPITRE V. AIRES DES FIGURES PLANES. Aire d'un polygone. 125i. Nous avons dja vu (55) comment on peai de'terminer l'aire d'un polygone quelconque A-BCD... F en faisant la somme alge'brique des aires des triangles OAB, OBC,.., etant un point quelconque du plan. Nous nous proposons d'en donner ici une nouvelle expression, qni pent avoir son inte'ret dans certains proble'mes. Soient K, L, M,..., Q(i.4)lspntmijeu.x Fig. 144. des c6te's AB, BC, CD,.... FA, respectivement, et 0 unpoint quelconque dn plan, qne nous prenons pour

/ 331
Pages

Actions

file_download Download Options Download this page PDF - Pages 138-157 Image - Page 146 Plain Text - Page 146

About this Item

Title
Théorie et applications des équipollences, par C. A. Laisant.
Author
Laisant, C.-A. (Charles-Ange), 1841-1920.
Canvas
Page 146
Publication
Paris,: Gauthier-Villars,
1887.
Subject terms
Coordinates

Technical Details

Link to this Item
https://name.umdl.umich.edu/abn7895.0001.001
Link to this scan
https://quod.lib.umich.edu/u/umhistmath/abn7895.0001.001/169

Rights and Permissions

The University of Michigan Library provides access to these materials for educational and research purposes. These materials are in the public domain in the United States. If you have questions about the collection, please contact Historical Mathematics Digital Collection Help at [email protected]. If you have concerns about the inclusion of an item in this collection, please contact Library Information Technology at [email protected].

DPLA Rights Statement: No Copyright - United States

Manifest
https://quod.lib.umich.edu/cgi/t/text/api/manifest/umhistmath:abn7895.0001.001

Cite this Item

Full citation
"Théorie et applications des équipollences, par C. A. Laisant." In the digital collection University of Michigan Historical Math Collection. https://name.umdl.umich.edu/abn7895.0001.001. University of Michigan Library Digital Collections. Accessed June 20, 2025.
Do you have questions about this content? Need to report a problem? Please contact us.