29,140 Hits in 4.0 sec

Tesselations by Connection in Orders [chapter]

Michel Couprie, Gilles Bertrand
2000 Lecture Notes in Computer Science  
We introduce the tesselation by connection, which is a transformation that preserves the connectivity, and can be implemented by a parallel algorithm.  ...  The watershed transformation is a powerful tool for segmenting images, but its precise de nition in discrete spaces raises di cult problems. We propose a new approach in the framework of orders.  ...  Tesselation by connection for weighted orders In this section, we extend the notions of uniconnected point and tesselation by connection to weighted orders.  ... 
doi:10.1007/3-540-44438-6_2 fatcat:pn3dhy33trfmpjgyz7hrbywqce

Discretization of continuous-time quantum walks via the staggered model with Hamiltonians [article]

Gabriel Coutinho, Renato Portugal
2018 arXiv   pre-print
This connection provides examples of perfect state transfer and instantaneous uniform mixing in the staggered model.  ...  On the other hand, we provide some more examples of perfect state transfer and instantaneous uniform mixing in the staggered model that cannot be reproduced by the continuous-time model.  ...  Suppose C 1 has only one element, which must be of order 2. Denote by {A 1 , ..., A k } the adjacency matrices of each tessellation induced by the cosets of C i ∪ id in G.  ... 
arXiv:1701.03423v2 fatcat:bh243hviy5dtzenqjdzbewcdbm

Adaptive tessellation of connected primitives for interactive walkthroughs in complex industrial virtual environments [chapter]

M. Krus, P. Bourdot, A. Osorio, F. Guisnel, G. Thibault
1999 Eurographics  
We extend a simple adaptive tessellation method which adapts the amount of triangles to the viewing conditions with connection information to ensure that the meshes of connected primitives remain continuous  ...  Geometrical primitives used in virtual environments are converted to an important amount triangles at rendering time.  ...  In order to prevent the creation of visual artifacts and ensure a "continuity" in the mesh, we describe the relations between primitives by the graph of their connections.  ... 
doi:10.1007/978-3-7091-6805-9_3 fatcat:gvgayjcckncebirdi6blrijjdu

Digitization of Partitions and Tessellations [chapter]

Jean Serra, B. Ravi Kiran
2016 Lecture Notes in Computer Science  
In the discrete case, the passage from partitions to tessellations is expressed by the Alexandrov topology and yields double resolutions.  ...  In both continuous and discrete spaces our approach rests on tessellations whose classes are R-open sets.  ...  The family T of all tessellations of E is obviously ordered by the following relation : τ ≤ τ ⇔ S(x) ⊆ S (x) x ∈ τ 0 τ, τ ∈ T (7) where S(x) (resp. S (x)) is the class of τ (resp. τ ) at point x.  ... 
doi:10.1007/978-3-319-32360-2_25 fatcat:5ckvtboz6vhffig55t62zvfcgm

Kinetic rosette patterns and tessellations

Valentina Beatini
2017 International Journal of Computational Methods & Experimental Measurements  
The paper investigates the possibility to create kinetic rosette patterns and their tessellations by means of modular linkages which rely on the same type and number of symmetry operations as the reference  ...  It is found that symmetry is an effective unifying concept in the design of both the fixed models and the mechanisms.  ...  Second, there may be alternative orders into which perform the symmetry operations underlying the tessellations, and thus different connection sequences between the rosettes.  ... 
doi:10.2495/cmem-v5-n4-631-641 fatcat:u4t3jtcobvhjlg7e2jpk7vscta

Palm calculus for stationary Cox processes on iterated random tessellations

F. Voss, C. Gloaguen, V. Schmidt
2009 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks  
It can be used, for example, in order to estimate the probability densities of various connection distances, which are important performance characteristics of telecommunication networks.  ...  In particular, we analyze the Palm version X * of stationary Cox processes X living on random graphs that are built by the edges of an iterated random tessellation T .  ...  ACKNOWLEDGEMENT This research has been supported by Orange Labs (Research agreement 46143714).  ... 
doi:10.1109/wiopt.2009.5291572 dblp:conf/wiopt/VossGS09 fatcat:nepzhwk3ljb7tbnfnrfczkkivy

Constraint percolation on hyperbolic lattices

Jorge H. Lopez, J. M. Schwarz
2017 Physical review. E  
We study four constraint percolation models---k-core percolation (for k=1,2,3) and force-balance percolation---on several tessellations of the hyperbolic plane.  ...  Hyperbolic lattices interpolate between finite-dimensional lattices and Bethe lattices and are interesting in their own right with ordinary percolation exhibiting not one, but two, phase transitions.  ...  Bottom: Tree of connectivity z = 6 on the {4, 8} tessellation.  ... 
doi:10.1103/physreve.96.052108 pmid:29347694 fatcat:i5wspr5t2vehzd5mgviiwztn6q

Percolation for D2D Networks on Street Systems [article]

Elie Cali, Nila Novita Gafur, Christian Hirsch, Benedikt Jahnel, Taoufik En-Najjary, Robert I.A. Patterson
2018 arXiv   pre-print
We model the street systems as Poisson-Voronoi or Poisson-Delaunay tessellations with varying street lengths.  ...  We study fundamental characteristics for the connectivity of multi-hop D2D networks.  ...  For each new point, we use the union-find algorithm, see [14] , in order to update the connected components of the Gilbert graph.  ... 
arXiv:1801.10588v1 fatcat:35wppxeh6jatfluzbz3askuwma

Holography, cellulations and error correcting codes [article]

Marika Taylor, Charles Woodward
2021 arXiv   pre-print
These codes are based on uniform regular tessellations of hyperbolic space but we note that AME codes that preserve the discrete symmetry of the polytope of the tessellation do not exist above two dimensions  ...  In this paper we initiate a systematic study of codes associated with holographic geometries in higher dimensions, relating cellulations of the spatial sections of the geometries to stabiliser codes.  ...  Acknowledgments MT is supported in part by the Science and Technology Facilities Council (Consolidated Grant "Exploring the Limits of the Standard Model and Beyond").  ... 
arXiv:2112.12468v1 fatcat:nyo2qleusrgc7grgknvcsfnalm

Automated manifold surgery: constructing geometrically accurate and topologically correct models of the human cerebral cortex

B. Fischl, A. Liu, A.M. Dale
2001 IEEE Transactions on Medical Imaging  
Even single voxel misclassifications can result in erroneous connections being created between adjacent banks of a sulcus, resulting in a topologically inaccurate model.  ...  In order to address this need we have developed a technique for taking a model of the cortex, detecting and fixing the topological defects while leaving that majority of the model intact, resulting in  ...  The presence of topological defects in a polygonal tessellation can be easily detected by computing the Euler number of the tessellation.  ... 
doi:10.1109/42.906426 pmid:11293693 fatcat:trwgz6d45javdlpd362jzjmvmi

Meshing the Universe: Integrating Analysis in Cosmological Simulations

Tom Peterka, Juliana Kwan, Adrian Pope, Hal Finkel, Katrin Heitmann, Salman Habib, Jingyuan Wang, George Zagaris
2012 2012 SC Companion: High Performance Computing, Networking Storage and Analysis  
In the example highlighted in this paper, connected components of Voronoi cells are interrogated to detect and characterize cosmological voids.  ...  Meshing the output of petascale simulations, however, can be as data-intensive as the simulations themselves and often must be executed in parallel on the same supercomputers in order to fit in memory.  ...  In order to resolve such duplication, each process keeps the cells that have sites in its original particle set and deletes the cells owned by other processes.  ... 
doi:10.1109/sc.companion.2012.34 dblp:conf/sc/PeterkaKPFHHWZ12 fatcat:qrhkah5npvdu7l6udxhfw7gike

Hardware support for adaptive subdivision surface rendering

M. Bóo, M. Amor, M. Doggett, J. Hirche, W. Strasser
2001 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware - HWWS '01  
The communication requirements between the CPU and the graphics pipeline can be reduced if more detailed and complex surfaces are generated, as in displacement mapping, by an adaptive tessellation unit  ...  The architecutre is regular and characterized by an efficient data management that minimizes the data storage and avoids the wait cycles that would be associated with the multiple data accesses required  ...  Bóo in the WSI/GRIS Department, University of Tübingen, Germany (stay supported by "Secretaría Xeral de Investigación e Desenvolvemento", Xunta de Galicia, Spain).  ... 
doi:10.1145/383507.383522 fatcat:gepcsnwsbvh5jj2dwg2ifcrax4

An Efficient Visualization Method for Polygonal Data with Dynamic Simplification

Mingguang Wu, Taisheng Chen, Kun Zhang, Zhimin Jing, Yangli Han, Menglin Chen, Hong Wang, Guonian Lv
2018 ISPRS International Journal of Geo-Information  
Here, we present an efficient polygonal data visualization method by organizing the simplification, tessellation and rendering operations into a single mesh generalization process.  ...  In fact, polygons, no matter how complex they are [28] , may be tessellated into drawable primitives, such as triangles or trapezoids (e.g., triangle-strip or quad-strip in OpenGL) for cartographic filling  ...  Similarly, a joined link connects two vertically neighboring trapezoids, but the top one has siblings. All siblings are ordered by their increasing x-coordinates.  ... 
doi:10.3390/ijgi7040138 fatcat:m74cudgoyrbnjd4ni5o5al4pma

Random Tessellations and Boolean Random Functions [chapter]

Dominique Jeulin
2013 Lecture Notes in Computer Science  
Reminder on random tessellations Random tessellations were formalized by G. Matheron in [11] . Definition 1.  ...  Generalizations of various random tessellation models generated by Poisson point processes are proposed and their functional probability P (K) is given.  ...  This is illustrated in Figure 1 by a simulation in R, where a non connected class C k is generated by the point x k .  ... 
doi:10.1007/978-3-642-38294-9_3 fatcat:hrat2yoso5an3bu6emwjf5bg7m

Tessellated Surface Reconstruction from 2D Contours [chapter]

Chee Fatt Chan, Chee Keong Kwoh, Ming Yeong Teo, Wan Sing Ng
1999 Lecture Notes in Computer Science  
Second, a tessellation algorithm approximates contours into line segments.  ...  Our new algorithm dealt with these problems in three steps. First, several adjacent contour mapping positions are used to reveal the correspondence of contours.  ...  Using such an ordering, only the incremental change of one vertex per triangle need to be specified, potentially reducing the rendering time by factor of three by avoiding redundant clipping and transformation  ... 
doi:10.1007/10704282_33 fatcat:7zjhbakg5rf5tffxtgc3g7v4q4
« Previous Showing results 1 — 15 out of 29,140 results