default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPedro Machado Manhães de Castro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c7]Kevin Buchin, Pedro Machado Manhães de Castro, Olivier Devillers, Menelaos Karavelas:
Hardness results on Voronoi, Laguerre and Apollonius diagrams. CCCG 2019: 99-104- 2018
- [j7]Pedro Machado Manhães de Castro, Olivier Devillers
:
Expected Length of the Voronoi Path in a High Dimensional Poisson-Delaunay Triangulation. Discret. Comput. Geom. 60(1): 200-219 (2018) - 2017
- [c6]Daniel Binham, Pedro Machado Manhães de Castro, Antoine Vigneron:
Reachability in a Planar Subdivision with Direction Constraints. SoCG 2017: 17:1-17:15 - 2016
- [j6]Pedro Machado Manhães de Castro, Quentin Mérigot, Boris Thibert:
Far-field reflector problem and intersection of paraboloids. Numerische Mathematik 134(2): 389-411 (2016) - 2014
- [j5]Pedro Machado Manhães de Castro, Lucas Almeida Pereira de Lima, Franklin Leandro Acioly Lucena:
Invariances of single curved manifolds applied to mesh segmentation. Comput. Graph. 38: 399-409 (2014) - [c5]Pedro Machado Manhães de Castro, Quentin Mérigot, Boris Thibert:
Intersection of paraboloids and application to Minkowski-type problems. SoCG 2014: 308 - [i1]Pedro Machado Manhães de Castro, Quentin Mérigot, Boris Thibert:
Intersection of paraboloids and application to Minkowski-type problems. CoRR abs/1403.0062 (2014) - 2013
- [j4]Pedro Machado Manhães de Castro, Olivier Devillers:
Practical distribution-sensitive point location in triangulations. Comput. Aided Geom. Des. 30(5): 431-450 (2013) - 2012
- [c4]Pedro Machado Manhães de Castro:
Invariance for Single Curved Manifold. SIBGRAPI 2012: 158-165 - 2011
- [j3]Pedro Machado Manhães de Castro, Olivier Devillers:
On the asymptotic growth rate of some spanning trees embedded in Rd. Oper. Res. Lett. 39(1): 44-48 (2011) - [c3]Pedro Machado Manhães de Castro, Olivier Devillers:
Simple and Efficient Distribution-Sensitive Point Location, in Triangulations. ALENEX 2011: 127-138 - [c2]Olivier Devillers, Pedro Machado Manhães de Castro:
A pedagogic JavaScript program for point location strategies. SCG 2011: 295-296 - 2010
- [b1]Pedro Machado Manhães de Castro:
Practical Ways to Accelerate Delaunay Triangulations. (Méthodes pour accélérer les triangulations de Delaunay). University of Nice Sophia Antipolis, France, 2010 - [c1]Manuel Caroli, Pedro Machado Manhães de Castro, Sébastien Loriot, Olivier Rouiller, Monique Teillaud, Camille Wormser:
Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere. SEA 2010: 462-473
2000 – 2009
- 2009
- [j2]Pedro Machado Manhães de Castro, Jane Tournois, Pierre Alliez, Olivier Devillers:
Filtering Relocations on a Delaunay Triangulation. Comput. Graph. Forum 28(5): 1465-1474 (2009) - [j1]Pedro Machado Manhães de Castro, Frédéric Cazals, Sébastien Loriot, Monique Teillaud:
Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere. Comput. Geom. 42(6-7): 536-550 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
