On minimal area augmentation of digital convex -gons
Snežana Matić-Kekić, Dragan M. Acketa (1998)
Mathematica Slovaca
Similarity:
Displaying similar documents to “A Linear Algorithm for Construction of Optimal Digital Convex 2k-gons”
On minimal area augmentation of digital convex -gons
An Algorithm for a Simple Construction of Suboptimal Digital Convex Polygons
Dragan M. Acketa, Snežana Matić-Kekić (1992)
The Yugoslav Journal of Operations Research
Similarity:
The rectilinear crossing number of is 62.
Brodsky, Alex, Durocher, Stephane, Gethner, Ellen (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a Construction of Digital Convex -gons of Minimum Diameter
Snežana Matič - Kekić, Dragan M. Acketa (1995)
The Yugoslav Journal of Operations Research
Similarity:
On the perspectives opened by right angle crossing drawings.
Angelini, Patrizio, Cittadini, Luca, Didimo, Walter, Frati, Fabrizio, Di Battista, Giuseppe, Kaufmann, Michael, Symvonis, Antonios (2011)
Journal of Graph Algorithms and Applications
Similarity:
Morphing planar graph drawings with bent edges.
Lubiw, Anna, Petrick, Mark (2011)
Journal of Graph Algorithms and Applications
Similarity:
On Eggleton and Guy’s conjectured upper bound for the crossing number of the -cube
Luerbio Faria, Celina Miraglia Herrera de Figueiredo (2000)
Mathematica Slovaca
Similarity:
On polygons and polyhedra
Siniša Vrećica (2005)
The Teaching of Mathematics
Similarity:
Edge Insertion for Optimal Triangulations.
H. Edelsbrunner, D. Eppstein, M. Bern, S. Mitchell, T.S. Tan (1993)
Discrete & computational geometry
Similarity:
Polar coordinate drawing of planar graphs with good angular resolution.
Duncan, Christian A., Kobourov, Stephen G. (2003)
Journal of Graph Algorithms and Applications
Similarity:
Upright-quad drawing of st-planar learning spaces.
Eppstein, David (2008)
Journal of Graph Algorithms and Applications
Similarity: