Results 1  10
of
36
Recent advances in compression of 3D meshes
 In Advances in Multiresolution for Geometric Modelling
, 2003
"... Summary. 3D meshes are widely used in graphic and simulation applications for approximating 3D objects. When representing complex shapes in a raw data format, meshes consume a large amount of space. Applications calling for compact storage and fast transmission of 3D meshes have motivated the multit ..."
Abstract

Cited by 73 (3 self)
 Add to MetaCart
Summary. 3D meshes are widely used in graphic and simulation applications for approximating 3D objects. When representing complex shapes in a raw data format, meshes consume a large amount of space. Applications calling for compact storage and fast transmission of 3D meshes have motivated the multitude of algorithms developed to efficiently compress these datasets. In this paper we survey recent developments in compression of 3D surface meshes. We survey the main ideas and intuition behind techniques for singlerate and progressive mesh coding. Where possible, we discuss the theoretical results obtained for asymptotic behavior or optimality of the approach. We also list some open questions and directions for future research. 1
An InformationTheoretic Upper Bound on Planar Graphs Using WellOrderly Maps
, 2011
"... This chapter deals with compressed coding of graphs. We focus on planar graphs, a widely studied class of graphs. A planar graph is a graph that admits an embedding in the plane without edge crossings. Planar maps (class of embeddings of a planar graph) are easier to study than planar graphs, but a ..."
Abstract

Cited by 23 (4 self)
 Add to MetaCart
This chapter deals with compressed coding of graphs. We focus on planar graphs, a widely studied class of graphs. A planar graph is a graph that admits an embedding in the plane without edge crossings. Planar maps (class of embeddings of a planar graph) are easier to study than planar graphs, but as a planar graph may admit an exponential number of maps, they give little information on graphs. In order to give an informationtheoretic upper bound on planar graphs, we introduce a definition of a quasicanonical embedding for planar graphs: wellorderly maps. This appears to be an useful tool to study and encode planar graphs. We present upper bounds on the number of unlabeled planar graphs and on the number of edges in a random planar graph. We also present an algorithm to compute wellorderly maps and implying an efficient coding of planar graphs.
Planar graphs, via wellorderly maps and trees
 IN 30 TH INTERNATIONAL WORKSHOP, GRAPH  THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG), VOLUME 3353 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2004
"... The family of wellorderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a wellorderly map. We show that the number of wellorderly maps with n nodes is at most 2 αn+O(log n) , where α ≈ 4.91. A direct consequence of th ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
The family of wellorderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a wellorderly map. We show that the number of wellorderly maps with n nodes is at most 2 αn+O(log n) , where α ≈ 4.91. A direct consequence of this is a new upper bound on the number p(n) of unlabeled planar graphs with n nodes, log 2 p(n) � 4.91n. The result is then used to show that asymptotically almost all (labeled or unlabeled), (connected or not) planar graphs with n nodes have between 1.85n and 2.44n edges. Finally we obtain as an outcome of our combinatorial analysis an explicit linear time encoding algorithm for unlabeled planar graphs using, in the worstcase, a rate of 4.91 bits per node and of 2.82 bits per edge.
Succinct Representations of Planar Maps
, 2008
"... This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the focus is here on designing data structures that preserve the possibility of answering incidence queries in constant time. W ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the focus is here on designing data structures that preserve the possibility of answering incidence queries in constant time. We propose in particular the first optimal representations for 3connected planar graphs and triangulations, which are the most standard classes of graphs underlying meshes with spherical topology. Optimal means that these representations asymptotically match the respective entropy of the two classes, namely 2 bits per edge for 3connected planar graphs, and 1.62 bits per triangle or equivalently 3.24 bits per vertex for triangulations. These representations support adjacency queries between vertices and faces in constant time.
Streaming Compression of Triangle Meshes
, 2005
"... Current mesh compression schemes encode triangles and vertices in an order derived from systematically traversing the connectivity graph. These schemes struggle with gigabytesized mesh input where the construction and the usage of the data structures that support topological traversal queries becom ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
Current mesh compression schemes encode triangles and vertices in an order derived from systematically traversing the connectivity graph. These schemes struggle with gigabytesized mesh input where the construction and the usage of the data structures that support topological traversal queries become I/Oinefficient and require large amounts of temporary disk space. Furthermore they expect the entire mesh as input. Since meshes cannot be compressed until their generation is complete, they have to be stored at least once in uncompressed form. We radically depart from the traditional approach to mesh compression and propose a scheme that incrementally encodes a mesh in the order it is given to the compressor using only minimal memory resources. This makes the compression process essentially transparent to the user and practically independent of the mesh size. This is especially beneficial for compressing large meshes, where previous approaches spend significant memory, disk, and I/O resources on preprocessing, whereas our scheme starts compressing after receiving the first few triangles.
Transversal structures on triangulations, combinatorial study and straightline drawing
, 2007
"... This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, called irreducible triangulations. The structure has been introduced by Xin He under the name of regular edgelabelling and consists of two transversal bip ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, called irreducible triangulations. The structure has been introduced by Xin He under the name of regular edgelabelling and consists of two transversal bipolar orientations. For this reason, the terminology used here is that of transversal structures. The main results obtained in the article are a bijection between irreducible triangulations and ternary trees, and a straightline drawing algorithm for irreducible triangulations. For a random irreducible triangulation with n vertices, the grid size of the drawing is asymptotically with high probability 11n/27 × 11n/27 up to an additive error of O ( √ n). In contrast, the best previously known algorithm for these triangulations only guarantees a grid size (⌈n/2 ⌉ − 1) × ⌊n/2⌋.
Succinct representation of triangulations with a boundary. WADS
, 2005
"... Abstract. We consider the problem of designing succinct geometric data structures while maintaining efficient navigation operations. A data structure is said succinct if the asymptotic amount of space it uses matches the entropy of the class of structures represented. For the case of planar triangul ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
Abstract. We consider the problem of designing succinct geometric data structures while maintaining efficient navigation operations. A data structure is said succinct if the asymptotic amount of space it uses matches the entropy of the class of structures represented. For the case of planar triangulations with a boundary we propose a succinct representation of the combinatorial information that improves to 2.175 bits per triangle the asymptotic amount of space required and that supports the navigation between adjacent triangles in constant time (as well as other standard operations). For triangulations with m faces of a surface with genus g, our representation requires asymptotically an extra amount of 36(g − 1) lg m bits (which is negligible as long as g ≪ m / lg m). 1
Transversal structures on triangulations, with application to straight line drawing
 LECTURE NOTES IN COMPUTER SCIENCE
, 2005
"... We define and study a structure called transversal edgepartition related to triangulations without non empty triangles, which is equivalent to the regular edge labeling discovered by Kant and He. We study other properties of this structure and show that it gives rise to a new straightline drawing ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
We define and study a structure called transversal edgepartition related to triangulations without non empty triangles, which is equivalent to the regular edge labeling discovered by Kant and He. We study other properties of this structure and show that it gives rise to a new straightline drawing algorithm for triangulations without non empty triangles, and more generally for 4connected plane graphs with at least 4 border vertices. Taking uniformly at random such a triangulation with 4 border vertices and n vertices, the size of the grid is almost surely n
Finite covers of random 3manifolds
, 2005
"... A 3manifold is Haken if it contains a topologically essential surface. The Virtual Haken Conjecture posits that every irreducible 3manifold with infinite fundamental group has a finite cover which is Haken. In this paper, we study random 3manifolds and their finite covers in an attempt to shed ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
A 3manifold is Haken if it contains a topologically essential surface. The Virtual Haken Conjecture posits that every irreducible 3manifold with infinite fundamental group has a finite cover which is Haken. In this paper, we study random 3manifolds and their finite covers in an attempt to shed light on this difficult question. In particular, we consider random Heegaard splittings by gluing two handlebodies by the result of a random walk in the mapping class group of a surface. For this model of random 3manifold, we are able to compute the probabilities that the resulting manifolds have finite covers of particular kinds. Our results contrast with the analogous probabilities for groups coming from random balanced presentations, giving quantitative theorems to the effect that 3manifold groups have many more finite quotients than random groups. The next natural question is whether these covers have positive betti number. For abelian covers of a fixed type over 3manifolds of Heegaard genus 2, we show that the probability of positive betti number is 0. In fact, many of these questions boil down to questions about the mapping class group. We are lead to consider the action of mapping class group of a surface Σ on