Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Carpenter's_rule_problem> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Carpenter's_rule_problem abstract "The carpenter's rule problem is a discrete geometry problem, which can be stated in the following manner: Can a simple planar polygon be moved continuously to a position where all its vertices are in convex position, so that the edge lengths and simplicity are preserved along the way? A closely related problem is to show that any polygon can be convexified, that is, continuously transformed, preserving edge distances and avoiding crossings, into a convex polygon.Both problems were successfully solved by Connelly, Demaine & Rote (2000).".
- Carpenter's_rule_problem wikiPageExternalLink motion.ps.
- Carpenter's_rule_problem wikiPageExternalLink Straightening+polygonal+arcs+and+convexifying+polygonal+cycles-DCG.pdf.
- Carpenter's_rule_problem wikiPageID "3269639".
- Carpenter's_rule_problem wikiPageRevisionID "566860456".
- Carpenter's_rule_problem hasPhotoCollection Carpenter's_rule_problem.
- Carpenter's_rule_problem subject Category:Discrete_geometry.
- Carpenter's_rule_problem subject Category:Mathematical_problems.
- Carpenter's_rule_problem subject Category:Mathematics_of_rigidity.
- Carpenter's_rule_problem subject Category:Recreational_mathematics.
- Carpenter's_rule_problem type Abstraction100002137.
- Carpenter's_rule_problem type Attribute100024264.
- Carpenter's_rule_problem type Condition113920835.
- Carpenter's_rule_problem type Difficulty114408086.
- Carpenter's_rule_problem type MathematicalProblems.
- Carpenter's_rule_problem type Problem114410605.
- Carpenter's_rule_problem type State100024720.
- Carpenter's_rule_problem comment "The carpenter's rule problem is a discrete geometry problem, which can be stated in the following manner: Can a simple planar polygon be moved continuously to a position where all its vertices are in convex position, so that the edge lengths and simplicity are preserved along the way? A closely related problem is to show that any polygon can be convexified, that is, continuously transformed, preserving edge distances and avoiding crossings, into a convex polygon.Both problems were successfully solved by Connelly, Demaine & Rote (2000).".
- Carpenter's_rule_problem label "Carpenter's rule problem".
- Carpenter's_rule_problem sameAs m.092fpy.
- Carpenter's_rule_problem sameAs Q5045673.
- Carpenter's_rule_problem sameAs Q5045673.
- Carpenter's_rule_problem sameAs Carpenter's_rule_problem.
- Carpenter's_rule_problem wasDerivedFrom Carpenter's_rule_problem?oldid=566860456.
- Carpenter's_rule_problem isPrimaryTopicOf Carpenter's_rule_problem.