| [ QuizWit ] in KIDS 글 쓴 이(By): pinkrose (Wenger) 날 짜 (Date): 1999년 2월 9일 화요일 오전 01시 49분 20초 제 목(Title): [ans] comp. geom. >Suppose X consists of only one cell at (1,1,1), and let's add a new cell c at (2,2,2). No faces of c are shared with X, but a vertex is shared. Can a machine recognize this without accessing 8 neighbor cells? ^^ ------------------------------------------------------------- I didn't understand what you where talking about the last time when you talked about 8 cells. You see, a newly attached cell has at most 7 neighboring cells not 8. Not I understand what you meant by 8 cells. You have to be more clear and specific to be understood. I admit the actual implementation is not as easy as my elegant formular: X(A U C) = X(A) + #vertex - #edges + #faces - #cell Well, if it is not simple in computer code, it is still the simplest and the most elegant algorithm. I thought math is very objective. When we see an elegant proof, everyone knows by heart that it is beautiful. The reason, I didn't admire your your computer code which may be true or may not be ture is that I failed to understand it. Do you care to tell us what you did? I don't think not many people has a stomach to read thru your code when even the problme poster failed to do it. :) They said "What sign can you give us to see, so that we may believe you?" |