PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Kriegel, Klaus"

Author of the publication

copydeleteadd this publication to your clipboard
Covering Simple Polygonal Regions by Ellipses.

, , , and . EuroCG, page 89-92. (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Janos Klaus University of Stuttgart

Klaus Hentschel

apl. Prof. Dr. -Ing. Klaus Leonhardt University of Stuttgart

Klaus Zintz

Dr. phil. Klaus Erlach University of Stuttgart

 

Other publications of authors with the same name

Bounds on the quality of the PCA bounding boxes., , , and . Comput. Geom., 42 (8): 772-789 (2009)Detection of perfect and approximate reflective symmetry in arbitrary dimension., and . VISAPP (2), page 128-136. INSTICC - Institute for Systems and Technologies of Information, Control and Communication, (2007)Triangles in Euclidean Arrangements., and . Discrete & Computational Geometry, 22 (3): 429-438 (1999)Tight bounds for conflict-free chromatic guarding of orthogonal art galleries., , , , and . Comput. Geom., (2018)Almost Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Galleries., , and . CoRR, (2014)Geometric algorithms for the analysis of 2D-electrophoresis gels., , , , and . RECOMB, page 114-123. ACM, (2001)Ein neues algorithmisches Verfahren zur Fluoroskopie-basierten Neuronavigation., , , , , and . Bildverarbeitung für die Medizin, volume 116 of CEUR Workshop Proceedings, page 229-233. CEUR-WS.org, (2004)The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus.. MFCS, volume 233 of Lecture Notes in Computer Science, page 484-492. Springer, (1986)On the Number of Cycles in Planar Graphs., , , , and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 97-107. Springer, (2007)The Polygon Exploration Problem., , , and . SIAM J. Comput., 31 (2): 577-600 (2001)