Laxmi Gewali

University of Nevada, Las Vegas

Papers

1

Total Citations

18

H-Index

1

About

Laxmi Gewali is a computer scientist whose work lies at the intersection of computational geometry and algorithm design, with a particular focus on geometric optimization and covering problems. His most-cited paper, "On covering orthogonal polygons with star-shaped polygons" (1992, 18 citations), addresses a fundamental challenge in geometric covering: efficiently decomposing orthogonal polygons into star-shaped components. This contribution has implications for visibility, robotics, and VLSI design, where partitioning complex shapes into simpler, star-shaped regions aids in path planning and layout analysis. Beyond this landmark work, Gewali has explored problems in terrain visibility, sensor network coverage, and geometric data structures, consistently advancing the theoretical foundations of computational geometry. His research is notable for its clarity and practical relevance, bridging abstract geometric theory with real-world applications. With a career spanning decades, Gewali has also mentored numerous students, fostering a new generation of researchers in algorithmic geometry. His work remains a touchstone for those studying polygon decomposition and geometric optimization, demonstrating how elegant mathematical solutions can drive progress in computing and engineering.

Research Focus

Key Achievements

1
H-Index
1
Papers
18
Total Citations
18
Avg Citations/Paper
🏆 Most Cited Paper
On covering orthogonal polygons with star-shaped polygons
18 citations · 1992
📈 Most Prolific Year: 1992 (1 Papers)
🤝 Key Collaborators: 2
🏛 Institutions: University of Nevada, Las Vegas

Top Papers

  1. 1

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 14 days ago