BEN-CHEN M.; GOTSMAN C.; BUNIN G. 2008 (Mesh Parameterization Mesh Parameterization): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(n log^{2}n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2008 == Reference == http://www.cs.technion.ac.il/~gotsman/AmendedPubl/Miri/EG08_Conf.pdf")
 
No edit summary
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


$O(n log^{2}n)$
$O(n \log^{2}n)$


== Space Complexity ==  
== Space Complexity ==  

Latest revision as of 09:48, 10 April 2023

Time Complexity

$O(n \log^{2}n)$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2008

Reference

http://www.cs.technion.ac.il/~gotsman/AmendedPubl/Miri/EG08_Conf.pdf