三絕草堂

Wednesday, April 06, 2011

UVa 634 Polygon

Solution: draw a vertical line segment L from point (x, y) to (x, MIN), and then count the number of intersection of L and polygon edges.

Posted by xacid at 10:47 PM
Labels: algorithm

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Links

  • 三絕草堂
  • Other Pages

New Articles

Loading...

Labels

  • algorithm (21)
  • bicycle (13)
  • Cpp (10)
  • linux (4)
  • java (2)
  • BFS (1)
  • coding (1)
  • dynamic programming (1)
  • fat32 (1)
  • web design (1)
  • 環島 (1)

Blog Archive

  • ►  2015 (1)
    • ►  April (1)
  • ►  2014 (10)
    • ►  May (4)
    • ►  April (3)
    • ►  March (3)
  • ▼  2011 (2)
    • ▼  April (2)
      • UVa 634 Polygon
      • UVa 633 A Chess Knight
  • ►  2010 (21)
    • ►  October (1)
    • ►  August (20)
  • ►  2009 (2)
    • ►  April (2)
  • ►  2008 (4)
    • ►  September (1)
    • ►  August (2)
    • ►  March (1)
  • ►  2007 (19)
    • ►  September (2)
    • ►  August (5)
    • ►  July (5)
    • ►  June (2)
    • ►  January (5)
  • ►  2006 (10)
    • ►  December (1)
    • ►  November (2)
    • ►  October (1)
    • ►  September (6)
Simple theme. Theme images by Nikada. Powered by Blogger.