ReP USP - Resultado da busca

Trabalho de evento
Parallelization of filling algorithms on distributed memory machines using the point containment paradigm (2000)
Fabris, Antonio Elias ; Assis, Marcos Machado Ottani; Forrest, A. Robin
Source: Proceedings. Conference titles: Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens - SIBGRAPI. 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 ASSIS, Marcos Machado Ottani e FORREST, A. Robin. Parallelization of filling algorithms on distributed memory machines using the point containment paradigm. 2000, Anais.. Los alamitos: IEEE, 2000. Disponível em: https://doi.org/10.1109/SIBGRA.2000.883918. Acesso em: 18 nov. 2024.
APA
Fabris, A. E., Assis, M. M. O., & Forrest, A. R. (2000). Parallelization of filling algorithms on distributed memory machines using the point containment paradigm. In Proceedings. Los alamitos: IEEE. doi:10.1109/SIBGRA.2000.883918
NLM
Fabris AE, Assis MMO, Forrest AR. Parallelization of filling algorithms on distributed memory machines using the point containment paradigm [Internet]. Proceedings. 2000 ;[citado 2024 nov. 18 ] Available from: https://doi.org/10.1109/SIBGRA.2000.883918
Vancouver
Fabris AE, Assis MMO, Forrest AR. Parallelization of filling algorithms on distributed memory machines using the point containment paradigm [Internet]. Proceedings. 2000 ;[citado 2024 nov. 18 ] Available from: https://doi.org/10.1109/SIBGRA.2000.883918
Trabalho de evento
Stroking discrete polynomial Bezier curves via point containment paradigm (1998)
Fabris, Antonio Elias ; Silva, Luciano; Forrest, A. Robin
Source: Proceedings. Conference titles: International Symposium on Computer Graphics, Image Processing, and Vision - SIBGRAPI. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, GEOMETRIA COMPUTACIONAL, 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. Stroking discrete polynomial Bezier curves via point containment paradigm. 1998, Anais.. Piscataway: IEEE, 1998. Disponível em: https://doi.org/10.1109/SIBGRA.1998.722738. Acesso em: 18 nov. 2024.
APA
Fabris, A. E., Silva, L., & Forrest, A. R. (1998). Stroking discrete polynomial Bezier curves via point containment paradigm. In Proceedings. Piscataway: IEEE. doi:10.1109/SIBGRA.1998.722738
NLM
Fabris AE, Silva L, Forrest AR. Stroking discrete polynomial Bezier curves via point containment paradigm [Internet]. Proceedings. 1998 ;[citado 2024 nov. 18 ] Available from: https://doi.org/10.1109/SIBGRA.1998.722738
Vancouver
Fabris AE, Silva L, Forrest AR. Stroking discrete polynomial Bezier curves via point containment paradigm [Internet]. Proceedings. 1998 ;[citado 2024 nov. 18 ] Available from: https://doi.org/10.1109/SIBGRA.1998.722738
Trabalho de evento
An efficient filling algorithm for non-simple closed curves using the point containment paradigm (1997)
Fabris, Antonio Elias ; Silva, Luciano; Forrest, A. Robin
Source: Proceedings. Conference titles: 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: 18 nov. 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 nov. 18 ] 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 nov. 18 ] Available from: https://doi.org/10.1109/SIGRA.1997.625138
Trabalho de evento
High quality rendering of two-dimensional continuous curves (1997)
Fabris, Antonio Elias ; Forrest, A. Robin
Source: Proceedings. Conference titles: 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 FORREST, A. Robin. High quality rendering of two-dimensional continuous curves. 1997, Anais.. Piscataway: IEEE, 1997. Disponível em: https://doi.org/10.1109/SIGRA.1997.625142. Acesso em: 18 nov. 2024.
APA
Fabris, A. E., & Forrest, A. R. (1997). High quality rendering of two-dimensional continuous curves. In Proceedings. Piscataway: IEEE. doi:10.1109/SIGRA.1997.625142
NLM
Fabris AE, Forrest AR. High quality rendering of two-dimensional continuous curves [Internet]. Proceedings. 1997 ;[citado 2024 nov. 18 ] Available from: https://doi.org/10.1109/SIGRA.1997.625142
Vancouver
Fabris AE, Forrest AR. High quality rendering of two-dimensional continuous curves [Internet]. Proceedings. 1997 ;[citado 2024 nov. 18 ] Available from: https://doi.org/10.1109/SIGRA.1997.625142

USP Schools

ReP

Filtros