Search results for "020207 software engineering"
showing 10 items of 475 documents
Multiresolution Analysis for Meshes with Appearance Attributes
2005
International audience; We present a new multiresolution analysis framework for irregular meshes with attributes based on the lifting scheme. We introduce a surface prediction operator to compute the detail coefficients for the geometry and the attributes of the model. Attribute analysis gives appearance information to complete the geometrical analysis of the model. A set of experimental results are given to show the efficiency of our framework. We present two applications to adaptive visual-ization and denoising.
Subdivisions of Ring Dupin Cyclides Using Bézier Curves with Mass Points
2021
Dupin cyclides are algebraic surfaces introduced for the first time in 1822 by the French mathematician Pierre-Charles Dupin. A Dupin cyclide can be defined as the envelope of a one-parameter family of oriented spheres, in two different ways. R. Martin is the first author who thought to use these surfaces in CAD/CAM and geometric modeling. The Minkowski-Lorentz space is a generalization of the space-time used in Einstein’s theory, equipped of the non-degenerate indefinite quadratic form $$Q_{M} ( \vec{u} ) = x^{2} + y^{2} + z^{2} - c^{2} t^{2}$$ where (x, y, z) are the spacial components of the vector $$ \vec{u}$$ and t is the time component of $$ \vec{u}$$ and c is the constant of the spee…
Boolean operations with implicit and parametric representation of primitives using R-functions
2005
We present a new and efficient algorithm to accurately polygonize an implicit surface generated by multiple Boolean operations with globally deformed primitives. Our algorithm is special in the sense that it can be applied to objects with both an implicit and a parametric representation, such as superquadrics, supershapes, and Dupin cyclides. The input is a constructive solid geometry tree (CSG tree) that contains the Boolean operations, the parameters of the primitives, and the global deformations. At each node of the CSG tree, the implicit formulations of the subtrees are used to quickly determine the parts to be transmitted to the parent node, while the primitives' parametric definition …
Multiresolution Analysis for Irregular Meshes
2003
International audience; The concept of multiresolution analysis applied to irregular meshes has become more and more important. Previous contributions proposed a variety of methods using simplification and/or subdivision algorithms to build a mesh pyramid. In this paper, we propose a multiresolution analysis framework for irregular meshes with attributes. Our framework is based on simplification and subdivision algorithms to build a mesh pyramid. We introduce a surface relaxation operator that allows to build a non-uniform subdivision for a low computational cost. Furthermore, we generalize the relaxationoperator to attributes such as color, texture, temperature, etc. The attribute analysis…
Combining Defocus and Photoconsistency for Depth Map Estimation in 3D Integral Imaging
2017
This paper presents the application of a depth estimation method for scenes acquired using a Synthetic Aperture Integral Imaging (SAII) technique. SAII is an autostereoscopic technique consisting of an array of cameras that acquires images from different perspectives. The depth estimation method combines a defocus and a correspondence measure. This approach obtains consistent results and shows noticeable improvement in the depth estimation as compared to a minimum variance minimisation strategy, also tested in our scenes. Further improvements are obtained for both methods when they are fed into a regularisation approach that takes into account the depth in the spatial neighbourhood of a pix…
Modelling and Testing of Real Systems
2016
Modelling and Programming are often used together in system development. However, typically there is a large conceptual gap between modelling and programming. This leads to problems in unified handling and the transition between the two. This way, extra work is required when combining modelling and programming. This paper develops a common understanding that can unify modelling and programming in system development.
Underlying Simple Graphs
2019
Summary In this article the notion of the underlying simple graph of a graph (as defined in [8]) is formalized in the Mizar system [5], along with some convenient variants. The property of a graph to be without decorators (as introduced in [7]) is formalized as well to serve as the base of graph enumerations in the future.
Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement
2017
Abstract We present a counterexample-guided abstraction refinement ( CEGAR) approach for the verification of safety properties of linear hybrid automata with large discrete state spaces, such as naturally arising when incorporating health state monitoring and degradation levels into the controller design. Such models can – in contrast to purely functional controller models – not be analyzed with hybrid verification engines relying on explicit representations of modes, but require fully symbolic representations for both the continuous and discrete part of the state space. The presented abstraction methods directly work on a symbolic representation of arbitrary non-convex combinations of line…
Tabu search for the dynamic Bipartite Drawing Problem
2018
Abstract Drawings of graphs have many applications and they are nowadays well-established tools in computer science in general, and optimization in particular. Project scheduling is one of the many areas in which representation of graphs constitutes an important instrument. The experience shows that the main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion to achieve it. Incremental or dynamic graph drawing is an emerging topic in this context, where we seek to preserve the layout of a graph over successive drawings. In this paper, we target the edge crossing reduction in the context of incremental graph drawing. Specifically…
Building Construction Sets by Tiling Grammar Simplification
2016
This paper poses the problem of fabricating physical construction sets from example geometry: A construction set provides a small number of different types of building blocks from which the example model as well as many similar variants can be reassembled. This process is formalized by tiling grammars. Our core contribution is an approach for simplifying tiling grammars such that we obtain physically manufacturable building blocks of controllable granularity while retaining variability, i.e., the ability to construct many different, related shapes. Simplification is performed by sequences of two types of elementary operations: non-local joint edge collapses in the tile graphs reduce the gra…