Results 1  10
of
12
Fundamentals of Spherical Parameterization for 3D Meshes
 PROCEEDINGS OF THE 2006 SYMPOSIUM ON INTERACTIVE 3D GRAPHICS AND GAMES, MARCH 1417, 2006
, 2003
"... Parametrization of 3D mesh data is important for many graphics applications, in particular for texture mapping, remeshing and morphing. Closed manifold genus0 meshes are topologically equivalent to a sphere, hence this is the natural parameter domain for them. Parametrizing a triangle mesh onto the ..."
Abstract

Cited by 104 (26 self)
 Add to MetaCart
Parametrization of 3D mesh data is important for many graphics applications, in particular for texture mapping, remeshing and morphing. Closed manifold genus0 meshes are topologically equivalent to a sphere, hence this is the natural parameter domain for them. Parametrizing a triangle mesh onto the sphere means assigning a 3D position on the unit sphere to each of the mesh vertices, such that the spherical triangles induced by the mesh connectivity do not overlap. Satisfying the nonoverlapping requirement is the most difficult and critical component of this process. We present a generalization of the method of barycentric coordinates for planar parametrization which solves the spherical parametrization problem, prove its correctness by establishing a connection to spectral graph theory and describe efficient numerical methods for computing these parametrizations.
Optimal Decision Trees
 R.P.I. Math Report No. 214, Rensselaer Polytechnic Institute
, 1996
"... We propose an Extreme Point Tabu Search (EPTS) algorithm that constructs globally optimal decision trees for classification problems. Typically, decision tree algorithms are greedy. They optimize the misclassification error of each decision sequentially. Our nongreedy approach minimizes the misclas ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We propose an Extreme Point Tabu Search (EPTS) algorithm that constructs globally optimal decision trees for classification problems. Typically, decision tree algorithms are greedy. They optimize the misclassification error of each decision sequentially. Our nongreedy approach minimizes the misclassification error of all the decisions in the tree concurrently. Using Global Tree Optimization (GTO), we can optimize existing decision trees. This capability can be used in classification and data mining applications to avoid overfitting, transfer knowledge, incorporate domain knowledge, and maintain existing decision trees. Our method works by fixing the structure of the decision tree and then representing it as a set of disjunctive linear inequalities. An optimization problem is constructed that minimizes the errors within the disjunctive linear inequalities. To reduce the misclassification error, a nonlinear error function is minimized over a polyhedral region. We show that it is suffici...
personal communication
"... We study the problem how to obtain a small drawing of a 3polytope with Euclidean distance between any two points at least 1. The problem can be reduced to a onedimensional problem, since it is sufficient to guarantee distinct integer xcoordinates. We develop an algorithm that yields an embedding ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We study the problem how to obtain a small drawing of a 3polytope with Euclidean distance between any two points at least 1. The problem can be reduced to a onedimensional problem, since it is sufficient to guarantee distinct integer xcoordinates. We develop an algorithm that yields an embedding with the desired property such that the polytope is contained inside a 2(n − 2) × 2 × 1 box. The constructed embedding can be scaled to a grid embedding whose xcoordinates are contained in [0, 2(n − 2)]. Furthermore, the point set of the embedding has a small spread, which differs from the best possible spread only by a multiplicative constant. Submitted:
Lectures on Polytopes: Updates, Corrections, and More
, 1999
"... be identied within Blind & Blind's [542] classication of all cubical dpolytopes with 2 d+1 vertices. (new 11/98) Pages 131132, Piles of Cubes: More interesting structure connected with the \piles of cubes" polytopes constructed and studied here has recently been uncovered by Athanasiadis [540]. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
be identied within Blind & Blind's [542] classication of all cubical dpolytopes with 2 d+1 vertices. (new 11/98) Pages 131132, Piles of Cubes: More interesting structure connected with the \piles of cubes" polytopes constructed and studied here has recently been uncovered by Athanasiadis [540]. (new 11/98) Chapter 6: See Eisenbud & Popescu [544] for an entirely dierent (algebraic geometry) view of Gale diagrams. (new 7/98) Pages 275277, Nonshellable balls: Masahiro Hachimori [547, 548] has studied constructibility of simplicial balls (a concept that is weaker than shellability). He found, for example, that while my 10 vertex example of a nonshellable ball [539] is constructible, Furch/Bing's knotted hole balls are not constructible  this is stronger than just saying that they are not shellable. (Hachimori also found that the facet list of Grunbaum's nonshellable ball, as given in [164],
Convex Approximation by Spherical Patches
, 2006
"... 3 Partially supported by the IST Programme of the EU as a Sharedcost RTD (FET Open) Project under Contract No IST006413 (ACS – Algorithms for Complex Shapes) Given points in convex position in three dimensions, we want to find an approximating convex surface consisting of spherical patches, such t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
3 Partially supported by the IST Programme of the EU as a Sharedcost RTD (FET Open) Project under Contract No IST006413 (ACS – Algorithms for Complex Shapes) Given points in convex position in three dimensions, we want to find an approximating convex surface consisting of spherical patches, such that all points are within some specified tolerance bound ε of the approximating surface. We describe a greedy algorithm which constructs an approximating surface whose spherical patches are associated to the faces of an inscribed polytope formed from a subset of the input points. We show that deciding whether an approximation with not more than a given number of spherical patches exists is NPhard by a reduction from planar 3SAT. 1
Small grid embeddings of 3polytopes
, 2009
"... We introduce an algorithm that embeds a given 3connected planar graph as a convex 3polytope with integer coordinates. The size of the coordinates is bounded by O(2 7.55n) = O(188 n). If the graph contains a triangle we can bound the integer coordinates by O(2 4.82n). If the graph contains a quadri ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce an algorithm that embeds a given 3connected planar graph as a convex 3polytope with integer coordinates. The size of the coordinates is bounded by O(2 7.55n) = O(188 n). If the graph contains a triangle we can bound the integer coordinates by O(2 4.82n). If the graph contains a quadrilateral we can bound the integer coordinates by O(2 5.54n). The crucial part of the algorithm is to find a convex plane embedding whose edges can be weighted such the sum of the weighted edges, seen as vectors, cancel at every point. It is well known that this can be guaranteed for the interior vertices by applying a technique of Tutte. We show how to extend Tutte’s ideas to construct a plane embedding where the weighted vector sums cancel also on the vertices of the boundary face.
Open Problems on Polytope Reconstruction
"... Introduction. There are several dierent ways to specify convex polytopes in three dimensions. One obvious explicit representation is a list of the vertex coordinates and connectivity information between the vertices, edges, and facets. But not all this information is necessary. For example, we can r ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Introduction. There are several dierent ways to specify convex polytopes in three dimensions. One obvious explicit representation is a list of the vertex coordinates and connectivity information between the vertices, edges, and facets. But not all this information is necessary. For example, we can reconstruct the explicit representation given only the vertex coordinates; this is the wellstudied ########### problem. By projective duality, we can also reconstruct the polytope from a list of halfspaces whose intersection is the polytope. Although these are the two most wellknown ways to specify polytopes, at least in the computational geometry community, they are not the only ones. Here we list several dierent theorems describing surprisingly small sets of information that are sucient to specify # dimensional convex polytopes. The purpose of this note is to pose the algorithmic versions of these theorems as intriguing open questions. That is, is there
Drawing 3polytopes with good vertex resolution
 In GD’09, Proc. 17th International Symposium on Graph Drawing, 2009, Lecture Notes in Computer Science
, 2010
"... Abstract. We study the problem how to obtain a small drawing of a 3polytope with Euclidean distance between any two points at least 1. The problem can be reduced to a onedimensional problem, since it is sufficient to guarantee distinct integer xcoordinates. We develop an algorithm that yields an ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We study the problem how to obtain a small drawing of a 3polytope with Euclidean distance between any two points at least 1. The problem can be reduced to a onedimensional problem, since it is sufficient to guarantee distinct integer xcoordinates. We develop an algorithm that yields an embedding with the desired property such that the polytope is contained in a 2(n−2)×2×1 box. The constructed embedding can be scaled to a grid embedding whose xcoordinates are contained in [0, 2(n − 2)]. Furthermore, the point set of the embedding has a small spread, which differs from the best possible spread only by a multiplicative constant. 1
Spherical approximation of convex shapes
"... Given points in convex position in three dimensions, we want to find an approximating convex surface consisting of spherical patches, such that all points are within some specified tolerance bound ε of the approximating surface. We describe a greedy algorithm which constructs an approximating surfa ..."
Abstract
 Add to MetaCart
Given points in convex position in three dimensions, we want to find an approximating convex surface consisting of spherical patches, such that all points are within some specified tolerance bound ε of the approximating surface. We describe a greedy algorithm which constructs an approximating surface whose spherical patches are associated to the faces of an inscribed polytope formed from a subset of the input points. We show that deciding whether an approximation with not more than a given number of spherical patches exists is NPhard by a reduction from planar 3SAT.
Realizing Planar Graphs as Convex Polytopes
"... Abstract. This is a survey on methods to construct a threedimensional convex polytope with a given combinatorial structure, that is, with the edges forming a given 3connected planar graph, focusing on efforts to achieve small integer coordinates. ..."
Abstract
 Add to MetaCart
Abstract. This is a survey on methods to construct a threedimensional convex polytope with a given combinatorial structure, that is, with the edges forming a given 3connected planar graph, focusing on efforts to achieve small integer coordinates.