Search results for "computer graphic"
showing 10 items of 530 documents
Cost-driven framework for progressive compression of textured meshes
2019
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…
On the problem of visualizing point distributions in high dimensional spaces
1995
Abstract Exploring dynamical systems with the aid of computer graphics requires that the relevant structures can be seen and be noticed. This poses special problems if the system is multidimensional, and it has to be decided which kind of projection serves the purpose. I propose using the mathematical frame of categories and functors to describe the process of visualization. This allows detecting and analyzing possible sources of misinterpretation in a formal way. The distribution of distances of embedded electroencephalographic data from a fixed reference point is used as an example for discussing some aspects of the visualization process. The multidimensional p-norms are an example of a p…
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…
A simple algorithm for drawing large graphs on small screens
1995
Viewing a large graph in limited display space has traditionally been accomplished using either reduced scale rendering of the graph or by attaching scrollbars to a view window which shows only a small portion of the entire graph. Recent work, however, has concentrated on integrating a locally detailed view with a globally scaled view. We present an algorithm for constructing a view which smoothly integrates local detail and global context in a single view window and describe user interaction with such a display.
Mesh connectivity compression using convection reconstruction
2007
International audience; During a highly productive period running from 1995 to about 2002, the research in lossless compression of 3D meshes mainly consisted in a hard battle for the best bitrates. But for a few years, compression rates seem stabilized around 1.5 bit per vertex for the connectivity coding of usual meshes, and more and more work is dedicated to remeshing, lossy compression, or gigantic mesh compression, where memory and CPU optimizations are the new priority. However, the size of 3D models keeps growing, and many application fields keep requiring lossless compression. In this paper, we present a new contribution for single-rate lossless connectivity compression, which first …
LeSSS: Learned Shared Semantic Spaces for Relating Multi-Modal Representations of 3D Shapes
2015
In this paper, we propose a new method for structuring multi-modal representations of shapes according to semantic relations. We learn a metric that links semantically similar objects represented in different modalities. First, 3D-shapes are associated with textual labels by learning how textual attributes are related to the observed geometry. Correlations between similar labels are captured by simultaneously embedding labels and shape descriptors into a common latent space in which an inner product corresponds to similarity. The mapping is learned robustly by optimizing a rank-based loss function under a sparseness prior for the spectrum of the matrix of all classifiers. Second, we extend …
Mean Field Linear Quadratic Games with Set Up Costs
2013
This paper studies linear quadratic games with set up costs monotonic on the number of active players, namely, players whose action is non-null. Such games arise naturally in joint replenishment inventory systems. Building upon a preliminary analysis of the properties of the best response strategies and Nash equilibria for the given game, the main contribution is the study of the same game under large population. We also analyze the influence of an additional disturbance in the spirit of the literature on H∞ control. Numerical illustrations are provided. © 2012 Springer Science+Business Media New York.
Familiar objects and memory color
1998
This research was supported in part by a grant from ADEIT- Universitat de Valencia and IMPIVA to M.D. de F.
VR studio: Solid modelling in a Virtual Reality Environment
2007
Today one of the most important industrial needs is to improve the design process, making it faster and more robust; of course such a requirement can be obtained by using virtual reality. In the field of mechanical design, in fact, there is a great demand for more intuitive and natural modelling systems to speed up the modelling process. All that can be reached by stereocopic visualization tecnology and 3D input systems. In this paper we present a software for 3D solid modelling in a virtual reality system. The CAD models, carried out by this software, can be studied in their natural scale thanks to a large screen display. Moreover the user is free to move his hands to sketch the models tha…
Color memory matching: Time effect and other factors
1998
The methods of simultaneous and successive, or memory, color matching have been compared for 10 color reference samples distributed in two groups each performed by 50 observers (25 men and 25 women). Our results, obtained with a total of two hundred Munsell color chips arrayed on ten gray cardboard panels, indicate that: (a) while by simultaneous matching the mean color differences obtained are, in most cases, lower than 1 CIELAB unit, those obtained by memory are generally higher; (b) the worst remembered colors are yellow, light green, blue, and pink, and the best remembered color is orange; (c) the influence of the delay time (15 s, 15 min, and 24 h) is significant for the remembered mea…