An efficient filling algorithm for non-simple closed curves using the point containment paradigm

An efficient filling algorithm for non-simple closed curves using the point containment paradigm (1997)

Authors:
USP affiliated authors: FABRIS, ANTONIO ELIAS - IME ; SILVA, LUCIANO - IME
Unidade: IME
DOI: 10.1109/SIGRA.1997.625138
Assunto: COMPUTAÇÃO GRÁFICA
Language: Inglês
Imprenta:
- Publisher: IEEE
- Publisher place: Piscataway
- Date published: 1997
Source:
- Título do periódico: Proceedings
Conference titles: Brazilian Symposium on Computer Graphics and Image Processing

Informações sobre o DOI: 10.1109/SIGRA.1997.625138 (Fonte: oaDOI API)

A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

ABNT

FABRIS, Antonio Elias e SILVA, Luciano e FORREST, A. Robin. An efficient filling algorithm for non-simple closed curves using the point containment paradigm. 1997, Anais.. Piscataway: IEEE, 1997. Disponível em: https://doi.org/10.1109/SIGRA.1997.625138. Acesso em: 03 maio 2024.
APA

Fabris, A. E., Silva, L., & Forrest, A. R. (1997). An efficient filling algorithm for non-simple closed curves using the point containment paradigm. In Proceedings. Piscataway: IEEE. doi:10.1109/SIGRA.1997.625138
NLM

Fabris AE, Silva L, Forrest AR. An efficient filling algorithm for non-simple closed curves using the point containment paradigm [Internet]. Proceedings. 1997 ;[citado 2024 maio 03 ] Available from: https://doi.org/10.1109/SIGRA.1997.625138
Vancouver

Fabris AE, Silva L, Forrest AR. An efficient filling algorithm for non-simple closed curves using the point containment paradigm [Internet]. Proceedings. 1997 ;[citado 2024 maio 03 ] Available from: https://doi.org/10.1109/SIGRA.1997.625138