%0 Conference Paper %1 fhmsw-dgvsp-12 %A Fink, Martin %A Haunert, Jan-Henrik %A Mchedlidze, Tamara %A Spoerhase, Joachim %A Wolff, Alexander %B Proc. Workshop Algorithms Comput. (WALCOM'12) %D 2012 %E Rahman, Md. Saidur %E Nakano, Shin-ichi %I Springer-Verlag %K gd-info1 myown %P 186--197 %R 10.1007/978-3-642-28076-4_19 %T Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. %U http://dx.doi.org/10.1007/978-3-642-28076-4_19 %V 7157 %X Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attentionin the past few years. We consider problems in the intersection of these two areas. Given the point-set-embedding scenario, we are interested in how much we gain in terms of computational complexity, curve complexity, and generality if we allow large-angle crossings as compared to the planar case. We investigate two drawing styles where only bends or both bends and edges must be drawn on an underlying grid. We present results for drawings with one, two, and three bends per edge.

@inproceedings{fhmsw-dgvsp-12, abstract = {Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attentionin the past few years. We consider problems in the intersection of these two areas. Given the point-set-embedding scenario, we are interested in how much we gain in terms of computational complexity, curve complexity, and generality if we allow large-angle crossings as compared to the planar case. We investigate two drawing styles where only bends or both bends and edges must be drawn on an underlying grid. We present results for drawings with one, two, and three bends per edge.}, added-at = {2012-01-17T15:59:31.000+0100}, author = {Fink, Martin and Haunert, Jan-Henrik and Mchedlidze, Tamara and Spoerhase, Joachim and Wolff, Alexander}, biburl = {https://www.bibsonomy.org/bibtex/2aeaf84aa1660c5505800fa11b10ac9f4/fink}, booktitle = {Proc. Workshop Algorithms Comput. (WALCOM'12)}, doi = {10.1007/978-3-642-28076-4_19}, editor = {Rahman, Md. Saidur and Nakano, Shin-ichi}, interhash = {6d60510e4a3f549e0cf9f18ff618b6ad}, intrahash = {aeaf84aa1660c5505800fa11b10ac9f4}, keywords = {gd-info1 myown}, pages = {186--197}, pdf = {http://www1.informatik.uni-wuerzburg.de/pub/fink/paper/fhmsw-dgvsp-12.pdf}, publisher = {Springer-Verlag}, series = {Lecture Notes in Computer Science}, slides = {http://www1.informatik.uni-wuerzburg.de/pub/fink/slides/walcom2012-rac-pse-slides.pdf}, timestamp = {2013-06-17T10:49:09.000+0200}, title = {Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles.}, url = {http://dx.doi.org/10.1007/978-3-642-28076-4_19}, volume = 7157, year = 2012 }