Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Bend_minimization> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Bend_minimization abstract "In graph drawing styles that represent the edges of a graph by polylines (sequences of line segments connected at bends), it is desirable to minimize the number of bends per edge (sometimes called the curve complexity) or the total number of bends in a drawing. Bend minimization is the algorithmic problem of finding a drawing that minimizes these quantities.".
- Bend_minimization wikiPageID "43176911".
- Bend_minimization wikiPageLength "6341".
- Bend_minimization wikiPageOutDegree "18".
- Bend_minimization wikiPageRevisionID "702633065".
- Bend_minimization wikiPageWikiLink Algorithm.
- Bend_minimization wikiPageWikiLink Area_(graph_drawing).
- Bend_minimization wikiPageWikiLink Category:Graph_drawing.
- Bend_minimization wikiPageWikiLink Fxc3xa1rys_theorem.
- Bend_minimization wikiPageWikiLink Graph_(discrete_mathematics).
- Bend_minimization wikiPageWikiLink Graph_drawing.
- Bend_minimization wikiPageWikiLink Integer_lattice.
- Bend_minimization wikiPageWikiLink Integer_programming.
- Bend_minimization wikiPageWikiLink Line_segment.
- Bend_minimization wikiPageWikiLink Minimum-cost_flow_problem.
- Bend_minimization wikiPageWikiLink Orthogonal_drawing.
- Bend_minimization wikiPageWikiLink Planar_graph.
- Bend_minimization wikiPageWikiLink Polygonal_chain.
- Bend_minimization wikiPageWikiLink RAC_drawing.
- Bend_minimization wikiPageWikiLink Time_complexity.
- Bend_minimization wikiPageWikiLinkText "Bend minimization".
- Bend_minimization wikiPageWikiLinkText "bend minimization".
- Bend_minimization wikiPageWikiLinkText "bend".
- Bend_minimization wikiPageWikiLinkText "bends".
- Bend_minimization wikiPageWikiLinkText "number of bends".
- Bend_minimization wikiPageWikiLinkText "one bend per edge".
- Bend_minimization wikiPageWikiLinkText "unnecessary bends".
- Bend_minimization wikiPageUsesTemplate Template:Harvtxt.
- Bend_minimization wikiPageUsesTemplate Template:Reflist.
- Bend_minimization subject Category:Graph_drawing.
- Bend_minimization comment "In graph drawing styles that represent the edges of a graph by polylines (sequences of line segments connected at bends), it is desirable to minimize the number of bends per edge (sometimes called the curve complexity) or the total number of bends in a drawing. Bend minimization is the algorithmic problem of finding a drawing that minimizes these quantities.".
- Bend_minimization label "Bend minimization".
- Bend_minimization sameAs Q18205503.
- Bend_minimization sameAs m.0113jwny.
- Bend_minimization sameAs Q18205503.
- Bend_minimization wasDerivedFrom Bend_minimization?oldid=702633065.
- Bend_minimization isPrimaryTopicOf Bend_minimization.