An $O(n^2 \Log N)$ Time Algorithm for the Minmax Angle Triangulation

SIAM Journal on Scientific and Statistical Computing
doi 10.1137/0913058
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

An O(N Log N) Algorithm for Shape Modeling.

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1996English

An $O(m\log N)$-Time Algorithm for the Maximal Planar Subgraph Problem

SIAM Journal on Computing
MathematicsComputer Science
1993English

An O(log N) Dynamic Router-Table Design

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2004English

RANDOMIZATION YIELDS SIMPLE O(n Log⋆ N) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
1992English

The Discrete Logarithm Hides $O(\log N)$ Bits

SIAM Journal on Computing
MathematicsComputer Science
1988English

Constructing O(n Log N) Size Monotone Formulae for the K-Th Elementary Symmetric Polynomial of N Boolean Variables

English

An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion

2006English

On the Integral � Π/2 0 Log N Cosx Log P Sinx Dx

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1983English

Area-Time Optimal Division for T = Ω((log N)1 + Ε)

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1987English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy