نتایج جستجو برای: irregular tessellation

تعداد نتایج: 33047  

2003
G. De Fabritiis P. V. Coveney

In this paper, we review the computational aspects of a multiscale dissipative particle dynamics model for complex fluid simulations based on the feature-rich geometry of the Voronoi tessellation. The geometrical features of the model are critical since the mesh is directly connected to the physics by the interpretation of the Voronoi volumes of the tessellation as coarse-grained fluid clusters...

2013
David Wessel

This paper is about the role of the operating system (OS) within computer nodes of network audio systems. While many efforts in the network-audio community focus on low-latency network protocols, here we highlight the importance of the OS for network audio applications. We present Tessellation, an experimental OS tailored to multi-core processors. We show how specific OS features, such as guara...

2003
F. J. Espino Montserrat Bóo Margarita Amor Javier D. Bruguera

NURBS surfaces are widely used in computer graphics, due to their great accuracy of design and reduced amount of data needed for representation. For real-time visualization, tessellation algorithms are needed, as they make use of the actual graphics hardware through the conversion of surfaces to triangle meshes. The existent algorithms for tessellation are only partially adaptive because the te...

2012
Juan Mendez Javier Lorenzo

Some algorithms in Pattern Recognition and Machine Learning as neighborhood-based classification and dataset condensation can be improved with the use of Voronoi tessellation. The paper shows the weakness of some existing algorithms of tessellation to deal with high dimensional datasets. The use of linear programming can improve the tessellation procedures by focusing in Voronoi adjacency. It w...

2010
Violetta Lonati Matteo Pradella

We introduce a model of automaton for picture language recognition which is based on tiles and is called Wang automaton, since its description relies on the notation of Wang systems. Wang automata combine features of both online tessellation acceptors and 4-ways automata: as in online tessellation acceptors, computation assigns states to each picture position; as in 4-way automata, the input he...

Journal: :Discrete Mathematics & Theoretical Computer Science 2010
Violetta Lonati Matteo Pradella

We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessellation acceptors and 4-way automata: as in online tessellation acceptors, computation assigns states to each picture position; as in 4-way automata, the input head visits the picture moving from one pixel to an adjacen...

2009
Florence Le Ber Claire Lavigne Katarzyna Adamczyk Frédérique Angevin Nathalie Colbach Jean-François Mari Hervé Monod F. Le Ber C. Lavigne K. Adamczyk F. Angevin N. Colbach J.-F. Mari H. Monod

Neutral landscape models are not frequently used in the agronomical domain, whereas they would be very useful for studying given agro-ecological or physical processes. Contrary to ecological neutral landscape models, agricultural models have to represent and manage geometrical patches and thus should rely on tessellation methods. We present a three steps approach that aimed at simulating such l...

2018
Yanping Zhou Minlu Song Minwen Zhou Yiming Liu Fenghua Wang Xiaodong Sun

Purpose To investigate the choroidal thickness (CT) and retinal thickness (RT) in highly myopic tessellated eyes. Methods In this study, 115 highly myopic eyes were recruited and divided as tessellated fundus (n = 93) and normal fundus (n = 22). RT and CT were quantified using optical coherence tomography with enhanced depth imaging (EDI-OCT). Correlation between subfoveal CT (SFCT) and tesse...

2017
Herbert Edelsbrunner Anton Nikitenko

Slicing a Voronoi tessellation in R with a k-plane gives a k-dimensional weighted Voronoi tessellation, also known as power diagram or Laguerre tessellation. Mapping every simplex of the dual weighted Delaunay mosaic to the radius of the smallest empty circumscribed sphere whose center lies in the k-plane gives a generalized discrete Morse function. Assuming the Voronoi tessellation is generate...

Journal: :Comput. Geom. 1993
David G. Heath Simon Kasif

Our goal in this paper is to examine the application of Voronoi diagrams, a fundamental concept of computational geometry, to the nearest neighbor algorithm used in machine learning. We consider the question “Given a planar polygonal tessellation T and an integer k, is there a set of k points whose Voronoi diagram contains every edge in T?” We show that this question is NP-hard. We encountered ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید