On the tangent model for the density of lines and a Monte Carlo method for computing hypersurface area

DOI10.1515/MCMA-2017-0100MaRDI QIDQ515536zbMATH OpenOpenAlexFDO

Authors Khaldoun El Khaldi, Elias G. Saleeby

Publication date 16 March 2017

Published in Monte Carlo Methods and Applications (Search for Journal in Brave)

Full work available at URL https://www.degruyter.com/view/j/mcma.2017.23.issue-1/mcma-2017-0100/mcma-2017-0100.xml?format=INT

zbMATH Keywords

Monte Carlo methodintegral geometrygeometric objects\(n\)-ellipsoidsCauchy-Crofton formulaFermat-type varietieshypersurface arearandom linestangent model

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Integral geometry (53C65) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• On the density of lines and Santalo's formula for computing geometric size measures
• Using low-discrepancy sequences and the Crofton formula to compute surface areas of geometric models
• Surface area estimation of digitized 3D objects using quasi-Monte Carlo methods
• A quasi-Monte Carlo method for computing areas of point-sampled surfaces
• Estimation of surface area

Cites work

• scientific article; zbMATH DE number 3594346 (Why is no real title available?)
• scientific article; zbMATH DE number 1849873 (Why is no real title available?)
• A method for generating uniformly distributed points on \(N\)-dimensional spheres
• A note on a method for generating points uniformly on n -dimensional spheres
• Choosing a Point from the Surface of a Sphere
• EARLY HISTORY OF GEOMETRIC PROBABILITY AND STEREOLOGY
• On methods for generating uniform random points on the surface of a sphere
• Perimeters of Fermat ovals
• Surface area and capacity of ellipsoids in \(n\) dimensions
• The probability of a random straight line in two and three dimensions
• Using low-discrepancy sequences and the Crofton formula to compute surface areas of geometric models

Cited in

(4)

• On the density of lines and Santalo's formula for computing geometric size measures
• On intersection volumes of confidence hyper-ellipsoids and two geometric Monte Carlo methods
• A quasi-Monte Carlo method for computing areas of point-sampled surfaces
• Using low-discrepancy sequences and the Crofton formula to compute surface areas of geometric models

This page was built for publication: On the tangent model for the density of lines and a Monte Carlo method for computing hypersurface area

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515536)