Modeling Pittsburgh...With the Fewest Possible Polygons Kevin Abt Student I have been intrigued by 3D imagery since the early video games like Starfox and Doom. In trying to reproduce similar effects, I was surprised to find how simple it can be. Many of the techniques are very straightforward and easily put into action. Others can be more complex and time consuming, but not terribly difficult to create. I was approached to create a low polygon model of the city of Pittsburgh that could be used in an interactive demonstration/exhibit for travelers visiting the city. I was eager to do it but daunted by the scale of the project. Downtown Pittsburgh has more than 400 buildings large and small, hundreds of roads, dozens of bridges and many complex park areas. A large part of the challenge is making all these things with the fewest possible polygons and the smallest textures I can manage due to limitations in processing power. Computers can only handle a certain number of polygons and texture maps in real time as any 3D artist can tell you. I am still in the process of making the model but I have already found many interesting techniques.
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/modeling-pittsburgh-with-the-fewest-possible-polygons-L0Bnhk9q1d
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Modeling Pittsburgh...with the fewest possible polygons
Abt, Kevin
Follow ACM SIGGRAPH Computer Graphics
, Volume 37 (1)
Association for Computing Machinery – Feb 1, 2003
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
