DCG 2008 - PDF Preprint Papers

DCG 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DCG-2008 Paper

click to vote

DCG
2008

132views more DCG 2008»

Ehrhart Series and Lattice Triangulations

14 years 15 days ago

Download math.stanford.edu

Abstract We express the generating function for lattice points in a rational polyhedral cone with a simplicial subdivision in terms of multivariate analogues of the h-polynomials o...

Sam Payne

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	132	Ehrhart Series and Lattice Triangulations	claim
2	118	General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties	claim
3	110	A Centrally Symmetric Version of the Cyclic Polytope	claim
4	110	An Inscribing Model for Random Polytopes	claim
5	104	Finding the Homology of Submanifolds with High Confidence from Random Samples	claim
6	101	On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes	claim
7	93	Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings	claim
8	93	Robust Shape Fitting via Peeling and Grating Coresets	claim
9	93	Odd Crossing Number and Crossing Number Are Not the Same	claim
10	90	Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres	claim
11	88	On the Number of Birch Partitions	claim
12	86	Efficient Algorithms for Maximum Regression Depth	claim
13	86	Reconstruction Using Witness Complexes	claim
14	86	Circle Patterns on Singular Surfaces	claim
15	82	Visibility Graphs of Point Sets in the Plane	claim
16	82	Schnyder Woods and Orthogonal Surfaces	claim
17	81	A Dense Packing of Regular Tetrahedra	claim
18	80	Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem	claim
19	79	Automorphisms and Distinguishing Numbers of Geometric Cliques	claim
20	78	Self-Similar Tiling Systems, Topological Factors and Stretching Factors	claim
21	77	Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes	claim
22	76	Asymmetry of Convex Polytopes and Vertex Index of Symmetric Convex Bodies	claim
23	74	Helly-Type Theorems for Line Transversals to Disjoint Unit Balls	claim
24	71	Generating All Vertices of a Polyhedron Is Hard	claim
25	70	Decomposability of Polytopes	claim
26	69	Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D	claim
27	69	On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities	claim
28	68	Neighborly Embedded Manifolds	claim
29	64	Grid Vertex-Unfolding Orthogonal Polyhedra	claim
30	63	Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture	claim
31	52	Shellable Complexes and Topology of Diagonal Arrangements	claim
32	51	A Sharper Estimate on the Betti Numbers of Sets Defined by Quadratic Inequalities	claim
33	47	There Are Integral Heptagons, no Three Points on a Line, no Four on a Circle	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers