Fabris, Antonio Elias 
; Silva, Luciano; Forrest, A. Robin
Fonte: Proceedings. Nome do evento: Brazilian Symposium on Computer Graphics and Image Processing. Unidade: IME
Assunto: COMPUTAÇÃO GRÁFICA
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: 11 nov. 2025.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.625138NLM
Fabris AE, Silva L, Forrest AR. An efficient filling algorithm for non-simple closed curves using the point containment paradigm [Internet]. Proceedings. 1997 ;[citado 2025 nov. 11 ] Available from: https://doi.org/10.1109/SIGRA.1997.625138Vancouver
Fabris AE, Silva L, Forrest AR. An efficient filling algorithm for non-simple closed curves using the point containment paradigm [Internet]. Proceedings. 1997 ;[citado 2025 nov. 11 ] Available from: https://doi.org/10.1109/SIGRA.1997.625138
