Ravinder Krishnaswamy

  • Citations Per Year
Learn More
Binary Space Partitioning Trees have several applications in computer graphics. We prove that there exist n-polygon problem instances with an O(n<supscrpt>2</supscrpt>) lower bound on tree size. We also show that a greedy algorithm may result in constructing a tree with O(n<supscrpt>2</supscrpt>) nodes, while there exist a tree for the same n-polygon(More)
The slope of digital line segments is defined and an algorithm to evaluate it is presented. Parallelism and perpendicularity of two digital line segments are also defined. Finally, rectangular digital regions are defined and characterized, and an algorithm that determines whether or not a given digital region is a digital rectangle is presented.
  • 1