• UCI Home Page
  • Recent Entries
  • Archive
  • Friends
  • User Info
0xDE - December 9th, 2007
  • Links
  • RSS
  • Tags
  • Photos
  • Fano
  • Linkbacks
  • Tags
  • abstract games academia algorithms anonymity antimatroids architecture arrangements art art gallery aspect ratio associahedron bibliography bit parallelism blogging books bren hall carnival cellular automata central limits chord diagrams circles circulants color combinatorial enumeration combinatorics complexity theory computational geometry conferences configurations confluence continued fractions corporatization cryptography data compression de bruijn graph dissection dynamic programming economics egyptian fractions email entropy exponential algorithms family fano feminism flip graphs food free speech game theory geometric thickness geometry graffiti graph algorithms graph drawing graph theory gray graph group testing halloween harry potter humor hypercube information retrieval information visualization interdigitating trees inversion ireland johnson solids joshua tree karlsruhe knot theory korea landscape language line graph london magic maps math competition mathematics media theory mendocino miquel music namesakes nauru graph netherlands number theory open access optimal subtrees origami papers parametric optimization partial orders partitions peer review pell equation permutohedron photography pi plagiarism polar bears politics prague prime numbers python quadrilaterals ramsey theory rectangles regression depth regular numbers religion reptiles reset sequences robust statistics sandpile science security series parallel graphs sf peninsula slovenia smooth numbers social networks spam splay trees spork sports sports mathematics squarepants statistics stella octangula stormer's theorem straggler detection subgraph isomorphism sudoku symmetry talks teabag problem teaching threshold function tiling tools topology trees triangular numbers triangulation tukey depth turing machines typography uci unsolved venn diagrams visibility graph voting wikipedia xyz graphs youtube zonohedra
 
Previous Day | Next Day
 
0xDE
09 December 2007 @ 01:39 am
The topcoders count isosceles triangles  
Find an algorithm for counting the number of isosceles triangles in an n × n grid.

( Read more... )

( Added much simpler analysis )
Tags: computational geometry, number theory
 
2 comments | Leave a comment
 
 
Previous Day | Next Day