Learning for sustainability: partnerships for the goals
                        
                    - Award ID(s):
- 2130725
- PAR ID:
- 10465125
- Date Published:
- Journal Name:
- Sustainable Earth Reviews
- Volume:
- 6
- Issue:
- 1
- ISSN:
- 2731-9210
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
- 
            Beyersdorff, Olaf; Kanté, Mamadou Moustapha; Kupferman, Orna; Lokshtanov, Daniel (Ed.)Given a set P of n points and a set S of n segments in the plane, we consider the problem of computing for each segment of S its closest point in P. The previously best algorithm solves the problem in n^{4/3}2^{O(log^*n)} time [Bespamyatnikh, 2003] and a lower bound (under a somewhat restricted model) Ω(n^{4/3}) has also been proved. In this paper, we present an O(n^{4/3}) time algorithm and thus solve the problem optimally (under the restricted model). In addition, we also present data structures for solving the online version of the problem, i.e., given a query segment (or a line as a special case), find its closest point in P. Our new results improve the previous work.more » « less
- 
            Freeform optical surfaces offer significant design opportunities but pose new challenges in metrology and manufacturing. Evolution in optics manufacturing processes have changed the surface spatial frequencies that must be measured. Optical surface definition is expected to be with respect to fiducials and datums which must be realizable at all stages of manufacture; uncertainty in that realization becomes important in some cases. Concurrent engineering is required, but appropriate data has not been collated for use by optical designers. One approach to providing such data is described.more » « less
 An official website of the United States government
An official website of the United States government 
				
			 
					 
					
 
                                    