This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Geometric Constraint Lecture(Mar 2123) Instructor: Meera Sitharam, Recorded by Jianhua Fan Mar 21, 2006 1 Problem Categories 2 Five Questions 1. Given graph G , characterize d for which ( G, d ) has a realization. Here d are constraints, for example distance constraints. 2. Given graph G and constraints d , provide a realization. 3. Given grpah G , generically classify it into two categories: • It has nite number of realizations. One realization Many realizations • It has in nite number of realizations. 4. Given G , generically characterize the realization space. 5. Given nongeneric G , with xed or restricted d , answer question 3 and 4. Give the classi cation and description of its realization space. 3 Working on these Five Questions 3.1 Question 1 Problem: G is a complete distance graph, nd { d : ( G, d ) has a realization in R k space } . 1 Theorem: CayleyMenger conditions are the necessary and su cient conditions that ( G, d ) has a realization in R k space....
View
Full
Document
This note was uploaded on 11/09/2011 for the course CIS 6930 taught by Professor Staff during the Fall '08 term at University of Florida.
 Fall '08
 Staff

Click to edit the document details