Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ADG
2000
Springer

favoriteEmaildiscussreport

110views Mathematics» more ADG 2000»

Decision Complexity in Dynamic Geometry

13 years 9 months ago

Decision Complexity in Dynamic Geometry

Download kortenkamps.net

Abstract. Geometric straight-line programs [5, 8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding whether two instances of the same geometric straight-line program are connected by a continuous path, the Complex Reachability Problem.

Ulrich Kortenkamp, Jürgen Richter-Gebert

Real-time Traffic

ADG 2000 | Complex Reachability Problem | Geometric Constructions | Geometric Straight-line Program | Mathematics |

claim paper

Related Content

» Visualization of Complex Models Using Dynamic Texturebased Simplification

» Interactive Sampling and Rendering for Complex and Procedural Geometry

» Embedding intelligent decision making within complex dynamic environments

» Interactive rendering of acquired materials on dynamic geometry using bandwidth prediction

» Meshing Complexity of Single Part CAD Models

» Interactive Rendering of Dynamic Geometry

» Dynamic power management of complex systems using generalized stochastic Petri nets

» Analysing Dynamic Function Scheduling Decisions

» Interactive Global Illumination for Deformable Geometry in CUDA

Post Info
More Details (n/a)

Added	01 Aug 2010
Updated	01 Aug 2010
Type	Conference
Year	2000
Where	ADG
Authors	Ulrich Kortenkamp, Jürgen Richter-Gebert

Comments (0)