| Andrew Cooke | Contents | Latest | RSS | Twitter | Previous | Next

C[omp]ute

Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Lepl parser for Python.

Colorless Green.

Photography around Santiago.

SVG experiment.

Professional Portfolio

Calibration of seismometers.

Data access via web services.

Cache rewrite.

Extending OpenSSH.

C-ORM: docs, API.

Last 100 entries

An Easier Way; Julia's BinDeps (aka How To Install Cairo); Good Example Of Good Police Work (And Anonymity Being Hard); Best Santiago Burgers; Also; Michael Emmerich (Vibrator Translator) Interview (Japanese Books); Clarice Lispector (Brazillian Writer); Books On Evolution; Looks like Ara (Modular Phone) is dead; Index - Translations From Chile; More Emotion in Chilean Wines; Week 7; Aeon Magazine (Science-ish); QM, Deutsch, Constructor Theory; Interesting Talk Transcripts; Interesting Suggestion Of Election Fraud; "Hard" Books; Articles or Papers on depolarizing the US; Textbook for "QM as complex probabilities"; SFO Get Libor Trader (14 years); Why Are There Still So Many Jobs?; Navier Stokes Incomplete; More on Benford; FBI Claimed Vandalism; Architectural Tessellation; Also: Go, Blake's 7; Delusions of Gender (book); Crypto AG DID work with NSA / GCHQ; UNUMS (Universal Number Format); MOOCs (Massive Open Online Courses); Interesting Looking Game; Euler's Theorem for Polynomials; Weeks 3-6; Reddit Comment; Differential Cryptanalysis For Dummies; Japanese Graphic Design; Books To Be Re-Read; And Today I Learned Bugs Need Clear Examples; Factoring a 67 bit prime in your head; Islamic Geometric Art; Useful Julia Backtraces from Tasks; Nothing, however, is lost with less discomfort than that which, when lost, cannot be missed; Article on Didion; Cost of Living by City; British Slavery; Derrida on Metaphor; African SciFi; Traits in Julia; Alternative Japanese Lit; Pulic Key as Address (Snow); Why Information Grows; The Blindness Of The Chilean Elite; Some Victoriagate Links; This Is Why I Left StackOverflow; New TLS Implementation; Maths for Physicists; How I Am 8; 1000 Word Philosophy; Cyberpunk Reading List; Detailed Discussion of Message Dispatch in ParserCombinator Library for Julia; FizzBuzz in Julia w Dependent Types; kokko - Design Shop in Osaka; Summary of Greece, Currently; LLVM and GPUs; See Also; Schoolgirl Groyps (Maths); Japanese Lit; Another Example - Modular Arithmetic; Music from United; Python 2 and 3 compatible alternative.; Read Agatha Christie for the Plot; A Constructive Look at TempleOS; Music Thread w Many Recommendations; Fixed Version; A Useful Julia Macro To Define Equality And Hash; k3b cdrom access, OpenSuse 13.1; Week 2; From outside, the UK looks less than stellar; Huge Fonts in VirtualBox; Keen - Complex Emergencies; The Fallen of World War II; Some Spanish Fiction; Calling C From Fortran 95; Bjork DJ Set; Z3 Example With Python; Week 1; Useful Guide To Starting With IJulia; UK Election + Media; Review: Reinventing Organizations; Inline Assembly With Julia / LLVM; Against the definition of types; Dumb Crypto Paper; The Search For Quasi-Periodicity...; Is There An Alternative To Processing?; CARDIAC (CARDboard Illustrative Aid to Computation); The Bolivian Case Against Chile At The Hague; Clear, Cogent Economic Arguments For Immigration; A Program To Say If I Am Working; Decent Cards For Ill People; New Photo; Luksic And Barrick Gold

© 2006-2015 Andrew Cooke (site) / post authors (content).

Efficient Collision Detection with Pessimistic Measures

From: "andrew cooke" <andrew@...>

Date: Sat, 15 Sep 2007 16:16:32 -0400 (CLT)

I'm modelling a set of colliding lines (rods in 2D) and using Napito to
plot their trajectories.

Modelling individual lines is easy; the problem is reliably detecting
collisions.  In particular, I need to find the *first* collision amongst
all lines (since the movements change after a collision I am simply
restarting after that point - a future optimisation might do something
more sophisticated).

So this is some kind of search.  The trouble is that I don't have an
analytic solution for collisions.  Instead I have a fairly efficient but
pessimistic (it may give false positives) method for determining whether
any two lines touch within a given interval and an iterative method for
determining the time of intersection within some interval that is only
reliable in the limit of small intervals.

Finding the first possible pair of lines ("candidates") is easy - just use
the pessimistic method over progressively smaller time intervals.  But the
"limit of small intervals" makes everything uncertain and possibly
expensive - if you narrow down on an interval to search, and then find
that that it was unsuccessful (which is possible, since the initial
process is pessimistic), then what do you do?  It seems that you are
forced into a fairly detailed systematic search over time (and of
necessarily small intervals).

Fortunately, I can implement the candidate test in a way that makes it
progressively less pessimistic as the time interval decreases (it's
asymptotically correct).  So an explicit search is not that expensive. 
What becomes an issue then is the efficient broadening of the search to
include other candidates if the initial "best" fails.

This suggests that the best approach is to use a depth first search in
time (consider the tree that successively divides intervals in half),
discarding lines when they are not part of the overlapping group as you
descend, pruning when there are no candidates, and using the iterative
method as a test only at the very bottom "leaf" intervals.

In retrospect that seems obvious, but it's taken me a heck of a time to
see it clearly.  I keep being tempted to use the iterative method sooner
(when it works it converges rapidly, but when it fails I am left with no
way to fold that knowledge back into the search).

I guess there may be a future optimisation which uses the iterative
approach in some kind of speculative manner.  Perhaps when I am more
confident about its properties (it's just an analytic solution to a linear
approximation).

Andrew

Subtle, but Correct (I Hope)

From: "andrew cooke" <andrew@...>

Date: Sat, 15 Sep 2007 17:27:17 -0400 (CLT)

I forgot to mention an additional concern.  It's not really a concern,
since I think the previous argument is correct, but it was one reason I
took so long to get this clear.

Since the initial restriction is pessimistic you may, for any finite
interval, be "blocked" from finding a correct pair of colliding the lines
by the presence of one or more "confusing" lines, which are incorrectly
included.

This is resolved by searching all time ranges in progressively smaller
intervals and relying on the asymptotically correct behaviour to
eventually weed out the confusion.

What I had been trying to do, without much success, was remove the
confusion by pushing information back "up" the search tree.

Andrew

Comment on this post