A dynamic data structure for planar graph embedding

  • Tamassia R
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study a family of "classical" orthogonal polynomials which satisfy (apart from a 3-term recurrence relation) an eigenvalue problem with a differential operator of Dunkl-type. These polynomials can be obtained from the little $q$-Jacobi polynomials in the limit $q=-1$. We also show that these polynomials provide a nontrivial realization of the Askey-Wilson algebra for $q=-1$.

Cite

CITATION STYLE

APA

Tamassia, R. (1988). A dynamic data structure for planar graph embedding (pp. 576–590). https://doi.org/10.1007/3-540-19488-6_143

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free