Results 1  10
of
5,113
Straightline string with curvature
, 1995
"... Classical and quantum solutions for the relativistic straightline string with arbitrary dependence on the world surface curvature are obtained. They differ from the case of the usual NambuGoto interaction by the behaviour of the Regge trajectory which in general can be nonlinear. Regularization of ..."
Abstract
 Add to MetaCart
Classical and quantum solutions for the relativistic straightline string with arbitrary dependence on the world surface curvature are obtained. They differ from the case of the usual NambuGoto interaction by the behaviour of the Regge trajectory which in general can be nonlinear. Regularization
Straightline drawing of quadrangulations
 In Proceedings of Graph Drawing’06
, 2006
"... Abstract. This article introduces a straightline drawing algorithm for quadrangulations, in the family of the facecounting algorithms. It outputs in linear time a drawing on a regular W ×H grid such that W +H = n − 1 − ∆, where n is the number of vertices and ∆ is an explicit combinatorial paramet ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract. This article introduces a straightline drawing algorithm for quadrangulations, in the family of the facecounting algorithms. It outputs in linear time a drawing on a regular W ×H grid such that W +H = n − 1 − ∆, where n is the number of vertices and ∆ is an explicit combinatorial
Straight Line Triangle Representations
"... Which plane graphs admit a straight line representations such that all faces have the shape of a triangle? We present a characterization based on flat angle assignements, i.e., selections of angles of the graph that have size π in the representation. Another characterization is in terms of contact ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Which plane graphs admit a straight line representations such that all faces have the shape of a triangle? We present a characterization based on flat angle assignements, i.e., selections of angles of the graph that have size π in the representation. Another characterization is in terms
Indexing StraightLine Programs
, 2008
"... Straightline programs offer powerful text compression by representing a text T[1, u] in terms of a contextfree grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar repre ..."
Abstract
 Add to MetaCart
Straightline programs offer powerful text compression by representing a text T[1, u] in terms of a contextfree grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar
Bifurcation of straightline librations
, 710
"... We study a class of 2dimensional Hamiltonian systems H(x, y, px, py) = 1 2 (p2 x + p2 y) + V (x, y) in which the plane x=px=0 is invariant under the Hamiltonian flow, so that straightline librations along the y axis exist, and we also consider perturbations δH = δ · F(x, y, px, py) that preserve ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study a class of 2dimensional Hamiltonian systems H(x, y, px, py) = 1 2 (p2 x + p2 y) + V (x, y) in which the plane x=px=0 is invariant under the Hamiltonian flow, so that straightline librations along the y axis exist, and we also consider perturbations δH = δ · F(x, y, px, py) that preserve
On plane straightline graphs
, 2007
"... Geometric Graph Theory is a branch of both, Computational Geometry and Graph Theory, which deals with properties of straightline embeddings of graphs as well as algorithmic issues. In this diploma thesis, we consider three topics within the area of plane geometric graphs, namely angleconstrained g ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Geometric Graph Theory is a branch of both, Computational Geometry and Graph Theory, which deals with properties of straightline embeddings of graphs as well as algorithmic issues. In this diploma thesis, we consider three topics within the area of plane geometric graphs, namely angle
Lower Bounds for Straight Line Factoring
, 2010
"... Straight line factoring algorithms include a variant Lenstra’s elliptic curve method. This note proves lower bounds on the length of straight line factoring algorithms. ..."
Abstract
 Add to MetaCart
Straight line factoring algorithms include a variant Lenstra’s elliptic curve method. This note proves lower bounds on the length of straight line factoring algorithms.
STRAIGHTLINE REMOVAL IN BORON CARBIDE MICROSCOPIC IMAGES
, 2016
"... Straightline removal in boron carbide microscopic images ..."
Orthogonal Straight Line Drawing of Trees
, 1999
"... This paper is written for the purpose of describing my ScM Project. It introduces a drawing algorithm for a tree type of graph. The drawing algorithm is the extension of the orthogonal straight line drawing [1], which is implemented in java and the javadoc documentation is attached in the appendix. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper is written for the purpose of describing my ScM Project. It introduces a drawing algorithm for a tree type of graph. The drawing algorithm is the extension of the orthogonal straight line drawing [1], which is implemented in java and the javadoc documentation is attached in the appendix
Results 1  10
of
5,113