Related papers: Estimation of surface area
Surface roughness and texture are critical to the functional performance of engineering components. The ability to analyze roughness and texture effectively and efficiently is much needed to ensure surface quality in many surface generation…
We investigate the inference of varifold structures in a statistical framework: assuming that we have access to i.i.d. samples in $\mathbb{R}^n$ obtained from an underlying $d$--dimensional shape $S$ endowed with a possibly non uniform…
We present simulations of a cosmic shear survey and show how the survey geometry influences the accuracy of determination of cosmological parameters. We numerically calculate the full covariance matrices Cov of two-point statistics of…
This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when…
Consider a random smooth Gaussian field $G(x):F\to\mathbb{R}$, where $F$ is a compact in $\mathbb{R}^d$. We derive a formula for average area of a surface generated by the equation $G(x)=0$ and give some applications. As an auxiliary result…
Towards identifying the number of minimal surfaces sharing the same boundary from the geometry of the boundary, we propose a numerical scheme with high speed and high accuracy. Our numerical scheme is based on the method of fundamental…
In this work we deal with the problem of support estimation under shape restrictions. The shape restriction we deal with is an extension of the notion of convexity named alpha-convexity. Instead of assuming, as in the convex case, the…
We present a survey article about the geometry of convex bodies on the $d$-dimensional sphere $S^d$. We concentrate on the results based on the notion of the width of a convex body $C \subset S^d$ determined by a supporting hemisphere of…
Writing an uncomplicated, robust, and scalable three-dimensional convex hull algorithm is challenging and problematic. This includes, coplanar and collinear issues, numerical accuracy, performance, and complexity trade-offs. While there are…
We establish convergence results for a spatial semidiscretization of Mean Curvature Flow (MCF) for surfaces with fixed boundaries. Our analysis is based on Huisken's evolution equations for the mean curvature and the normal vector, enabling…
In this paper we provide an estimate from above for the value of the relaxed area functional for a map defined on a bounded domain of the plane with values in the plane and discontinuous on a regular simple curve with two endpoints. We show…
The identification of the interfacial molecules in fluid-fluid equilibrium is a long-standing problem in the area of simulation. We here propose a new point of view, making use of concepts taken from the field of computational geometry,…
We describe coordinate systems adapted for the space between two surfaces, such as those delineating the highly folded cortex in mammalian brains. These systems are estimated in order to satisfy geometric priors, including streamline…
We propose an algorithm to estimate the Hurst exponent of high-dimensional fractals, based on a generalized high-dimensional variance around a moving average low-pass filter. As working examples, we consider rough surfaces generated by the…
This paper presents an edge-based defocus blur estimation method from a single defocused image. We first distinguish edges that lie at depth discontinuities (called depth edges, for which the blur estimate is ambiguous) from edges that lie…
Solving the Plateau problem means to find the surface with minimal area among all surfaces with a given boundary. Part of the problem actually consists of giving a suitable definition to the notions of 'surface', 'area' and 'boundary'. In…
This article derives closed-form parametric formulas for the Minkowski sums of convex bodies in d-dimensional Euclidean space with boundaries that are smooth and have all positive sectional curvatures at every point. Under these conditions,…
We describe a two-level method for computing a function whose zero-level set is the surface reconstructed from given points scattered over the surface and associated with surface normal vectors. The function is defined as a linear…
The goal of this study is to provide a method for computing the following: Given a network of curves in 3d (satisfying a condition at the intersection points), compute efficiently a smooth surface such that the curves are geodesics on it.…
Cauchy's surface area formula says that for a convex body $K$ in $n$-dimensional Euclidean space the mean value of the $(n-1)$-dimensional volumes of the orthogonal projections of $K$ to hyperplanes is a constant multiple of the surface…