dc.contributor.author |
Klette, Reinhard |
en |
dc.contributor.author |
Schluns, Karsten |
en |
dc.date.accessioned |
2009-04-08T04:03:06Z |
en |
dc.date.available |
2009-04-08T04:03:06Z |
en |
dc.date.issued |
1996-08 |
en |
dc.identifier.citation |
Computer Science Technical Reports 133 (1996) |
en |
dc.identifier.issn |
1173-3500 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3482 |
en |
dc.description.abstract |
The paper starts with a review of integration techniques for calculating height maps from dense gradient
fields. There exist a few proposals of local integration methods (Coleman/Jain 1982, Healey/Jain 1984, Wu/Li
1988, Rodehorst 1993), and two proposals for global optimization (Horn/Brooks 1986 and Frankot/
Chellappa 1988). Several experimental evaluations of such integration techniques are discussed in this paper.
The examined algorithms received high markings on curved objects but low markings on polyhedral shapes.
Locally adaptive approaches are suggested to cope with complex shapes in general. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
Computer Science Technical Reports |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/csTRcgi.pl?serial |
en |
dc.title |
Height data from gradient fields |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |