Results 1  10
of
824,293
Minimum weight pseudotriangulations
 Proc. 24th Int. Conf. Foundations Software Tech. Theoretical Comput. Sci. (FSTTCS’04), volume 3328 of Lecture Notes in Computer Science
, 2004
"... Abstract. We consider the problem of computing a minimum weight pseudotriangulation of a set S of n points in the plane. We first present an O(n log n)time algorithm that produces a pseudotriangulation of weight O(log n·wt(M(S))) which is shown to be asymptotically worstcase optimal, i.e., there ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. We consider the problem of computing a minimum weight pseudotriangulation of a set S of n points in the plane. We first present an O(n log n)time algorithm that produces a pseudotriangulation of weight O(log n·wt(M(S))) which is shown to be asymptotically worstcase optimal, i
Abstract Minimum weight pseudotriangulations
"... We consider the problem of computing a minimum weight pseudotriangulation of a set S of n points in the plane. We first present an O(n log n)time algorithm that produces a pseudotriangulation of weight O(log n · wt(M(S))) which is shown to be asymptotically worstcase optimal, i.e., there exists ..."
Abstract
 Add to MetaCart
We consider the problem of computing a minimum weight pseudotriangulation of a set S of n points in the plane. We first present an O(n log n)time algorithm that produces a pseudotriangulation of weight O(log n · wt(M(S))) which is shown to be asymptotically worstcase optimal, i.e., there exists
PseudoTriangulations  a Survey
 CONTEMPORARY MATHEMATICS
"... A pseudotriangle is a simple polygon with exactly three convex vertices, and a pseudotriangulation is a facetoface tiling of a planar region into pseudotriangles. Pseudotriangulations appear as data structures in computational geometry, as planar barandjoint frameworks in rigidity theory an ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
A pseudotriangle is a simple polygon with exactly three convex vertices, and a pseudotriangulation is a facetoface tiling of a planar region into pseudotriangles. Pseudotriangulations appear as data structures in computational geometry, as planar barandjoint frameworks in rigidity theory
Contemporary Mathematics PseudoTriangulations  Survey
"... A pseudotriangle is a simple polygon with exactly three convex vertices, and a pseudotriangulation is a facetoface tiling of a planar region into pseudotriangles. Pseudotriangulations appear as data structures in computational geometry, as planar barandjoint frameworks in rigidity theory a ..."
Abstract
 Add to MetaCart
A pseudotriangle is a simple polygon with exactly three convex vertices, and a pseudotriangulation is a facetoface tiling of a planar region into pseudotriangles. Pseudotriangulations appear as data structures in computational geometry, as planar barandjoint frameworks in rigidity theory
Pseudotriangulations, rigidity and motion planning
 Discrete and Computational Geometry
, 2005
"... Abstract We propose a combinatorial approach to planning noncolliding trajectories for a polygonal barandjoint framework with n vertices. It is based on a new class of simple motionsinduced by expansive onedegreeoffreedom mechanisms, which guarantee noncollisions by moving all points away fr ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
event, a local alteration restores the pseudotriangulation. The motion continues for O(n3) steps until all the points are in convex position. 1 Introduction We present a combinatorial solution to the Carpenter's Rule Problem: how to plan noncolliding reconfigurations of a planar robot arm
On (Pointed) Minimum Weight PseudoTriangulations
"... In this note we discuss some structural properties of minimum weight (pointed) pseudotriangulations. 1 ..."
Abstract
 Add to MetaCart
In this note we discuss some structural properties of minimum weight (pointed) pseudotriangulations. 1
On Numbers of PseudoTriangulations∗
, 2014
"... We study the maximum numbers of pseudotriangulations and pointed pseudotriangulations that can be embedded over a specific set of points in the plane or contained in a specific triangulation. We derive the bounds O(5.45N) and Ω(2.41N) for the maximum number of pointed pseudotriangulations that c ..."
Abstract
 Add to MetaCart
We study the maximum numbers of pseudotriangulations and pointed pseudotriangulations that can be embedded over a specific set of points in the plane or contained in a specific triangulation. We derive the bounds O(5.45N) and Ω(2.41N) for the maximum number of pointed pseudotriangulations
Minimum weight pseudotriangulations (Extended Abstract)
"... Abstract. We consider the problem of computing a minimum weight pseudotriangulation of a set S of n points in the plane. We first present an O(n log n)time algorithm that produces a pseudotriangulation of weight O(wt(M(S)) · log n) which is shown to be asymptotically worstcase optimal, i.e., the ..."
Abstract
 Add to MetaCart
Abstract. We consider the problem of computing a minimum weight pseudotriangulation of a set S of n points in the plane. We first present an O(n log n)time algorithm that produces a pseudotriangulation of weight O(wt(M(S)) · log n) which is shown to be asymptotically worstcase optimal, i
Minimum Error Rate Training in Statistical Machine Translation
, 2003
"... Often, the training procedure for statistical machine translation models is based on maximum likelihood or related criteria. A general problem of this approach is that there is only a loose relation to the final translation quality on unseen text. In this paper, we analyze various training cri ..."
Abstract

Cited by 663 (7 self)
 Add to MetaCart
Often, the training procedure for statistical machine translation models is based on maximum likelihood or related criteria. A general problem of this approach is that there is only a loose relation to the final translation quality on unseen text. In this paper, we analyze various training criteria which directly optimize translation quality.
Results 1  10
of
824,293