0000000000266906
AUTHOR
Michael Hemmer
High quality conservative surface mesh generation for swept volumes
We present a novel, efficient and flexible scheme to generate a high quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. First, the approximation is conservative, i.e., the swept volume is enclosed by the generated mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined tolerance. Exploiting this tolerance the algorithm generates a mesh that is adapted to the local complexity of the swept volume boundary, keeping the overall output complexity remarkably low. The algorithm is two-phased: the actual sweep and the mesh generation. In the sweeping phase we introduce a gen…
High Precision Conservative Surface Mesh Generation for Swept Volumes
We present a novel, efficient, and flexible scheme to generate a high-quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. First, the approximation is conservative, i.e., the swept volume is enclosed by the generated mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined tolerance. Exploiting this tolerance the algorithm generates a mesh that is adapted to the local complexity of the swept volume boundary, keeping the overall output complexity remarkably low. The algorithm is two-phased: the actual sweep and the mesh generation. In the sweeping phase, we introduce a g…
A Complete, Exact and Efficient Implementation for Computing the Edge-Adjacency Graph of an Arrangement of Quadrics
International audience; We present a complete, exact and efficient implementation to compute the edge-adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the edge-adjacency graph of the arrangement. Our implementation is complete in the sense that it can handle all kinds of inputs including all degenerate ones, i.e. singularities or tangential intersection points. It is exact in that it always comp…
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
The original publication is available at www.springerlink.com ; ISBN 978-3-540-75519-7 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, \ie surfaces of algebraic degree~2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is {\em complete} in the sense that it can handle all kinds of…
Transient attosecond soft-X-ray spectroscopy in layered semi-metals (Conference Presentation)
X-ray absorption fine-structure (XAFS) spectroscopy is a well-established technique capable of extracting information about a material’s electronic and lattice structure with atomic resolution. While the near-edge region (XANES) of a XAFS spectrum provides information about the electronic configuration, structural information is extracted from the extended XAFS (EXAFS) spectrum, consisting of several hundreds of eV above the absorption edge. With the advent of high harmonic sources, reaching photon energies in soft x-ray (SXR) region, it now becomes possible to connect the spectroscopic capabilities of XAFS to the unprecedented attosecond temporal resolution of a high harmonic source allowi…
Exacus: Efficient and Exact Algorithms for Curves and Surfaces
We present the first release of the Exacus C++ libraries. We aim for systematic support of non-linear geometry in software libraries. Our goals are efficiency, correctness, completeness, clarity of the design, modularity, flexibility, and ease of use. We present the generic design and structure of the libraries, which currently compute arrangements of curves and curve segments of low algebraic degree, and boolean operations on polygons bounded by such segments.
Attosecond Soft-X-Ray Spectroscopy in a Transition Metal Dichalcogenide
Information about the real-time response of carriers to optical fields is paramount to advance information processing or to understand the bottlenecks of light-matter interaction and energy harvesting. Transition-metal dichalcogenide (TMDC) compounds are an emerging class of materials with attractive structural and electronic properties that can be thinned to the 2D limit and TiS 2 is a paradigmatic example for a semi-metallic TMDC, since its electron mobility ranges between that of a metal and a semiconductor.
Cost-driven framework for progressive compression of textured meshes
International audience; Recent advances in digitization of geometry and radiometry generate in routine massive amounts of surface meshes with texture or color attributes. This large amount of data can be compressed using a progressive approach which provides at decoding low complexity levels of details (LoDs) that are continuously refined until retrieving the original model. The goal of such a progressive mesh compression algorithm is to improve the overall quality of the transmission for the user, by optimizing the rate-distortion trade-off. In this paper, we introduce a novel meaningful measure for the cost of a progressive transmission of a textured mesh by observing that the rate-distor…
An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
We present the first exact, complete and efficient implementation that computes for a given set P=p1,...,pn of quadric surfaces the planar map induced by all intersection curves p1∩ pi, 2 ≤ i ≤ n, running on the surface of p1. The vertices in this graph are the singular and x-extreme points of the curves as well as all intersection points of pairs of curves. Two vertices are connected by an edge if the underlying points are connected by a branch of one of the curves. Our work is based on and extends ideas developed in [20] and [9].Our implementation is complete in the sense that it can handle all kind of inputs including all degenerate ones where intersection curves have singularities or pa…
Attosecond soft-X-ray spectroscopy of a transition metal dichalcogenide material
We use attosecond soft X-ray pulses between 284 eV to 543 eV for orbital-selective and real-time probing of the opto-electronic response of semi metallic TiS2.