AbstractWe use standard results from convex geometry to obtain representations of the prior and posterior degrees of imprecision in terms of width functions and difference bodies. These representations are used to construct algorithms for the calculation of the prior and the posterior degree of imprecision
It has been suggested in the literature that ordinary finite-precision oating-point arithmetic is in...
Abstract. Computational Convex Analysis algorithms have been rediscovered several times in the past ...
International audienceTaking into account written texts from Arab and Latin traditions of the geomet...
AbstractWe use standard results from convex geometry to obtain representations of the prior and post...
Traditional geometric algorithms are often presented as if input imprecision does not exist, even th...
discrepancy in numerical analysis and statistics Josef Dick∗ In this paper we discuss various connec...
Master of ScienceDepartment of MathematicsCraig SpencerThis paper introduces the basic elements of g...
International audienceWe study the development of formally proved algorithms for computational geome...
Convexity has played a major role in a variety of fields over the past decades. Never-theless, the c...
Imprecision is a long-standing problem in CAD design and high accuracy image-based reconstruction ap...
This book provides a self-contained introduction to convex geometry in Euclidean space. After coveri...
In this book chapter we survey known approaches and algorithms to compute discrepancy measures of po...
The field of computational geometry is concerned with the design and analysis of geometric algorithm...
From a broad perspective, we study issues related to implementation, testing, and experimentation in...
This is a preliminary version of a chapter that will appear in the {\em Handbook on Computational Ge...
It has been suggested in the literature that ordinary finite-precision oating-point arithmetic is in...
Abstract. Computational Convex Analysis algorithms have been rediscovered several times in the past ...
International audienceTaking into account written texts from Arab and Latin traditions of the geomet...
AbstractWe use standard results from convex geometry to obtain representations of the prior and post...
Traditional geometric algorithms are often presented as if input imprecision does not exist, even th...
discrepancy in numerical analysis and statistics Josef Dick∗ In this paper we discuss various connec...
Master of ScienceDepartment of MathematicsCraig SpencerThis paper introduces the basic elements of g...
International audienceWe study the development of formally proved algorithms for computational geome...
Convexity has played a major role in a variety of fields over the past decades. Never-theless, the c...
Imprecision is a long-standing problem in CAD design and high accuracy image-based reconstruction ap...
This book provides a self-contained introduction to convex geometry in Euclidean space. After coveri...
In this book chapter we survey known approaches and algorithms to compute discrepancy measures of po...
The field of computational geometry is concerned with the design and analysis of geometric algorithm...
From a broad perspective, we study issues related to implementation, testing, and experimentation in...
This is a preliminary version of a chapter that will appear in the {\em Handbook on Computational Ge...
It has been suggested in the literature that ordinary finite-precision oating-point arithmetic is in...
Abstract. Computational Convex Analysis algorithms have been rediscovered several times in the past ...
International audienceTaking into account written texts from Arab and Latin traditions of the geomet...
DOI
Add to ORKG