Research

Geometry through local topology.

Boolean operations, local topological methods, and their applications.

See also Overlaying maps, planar graphs, polyhedra.

2024

  • Salles V. G. Magalhães, W. Randolph Franklin, and Marcelo Menezes. Employing GPUs to accelerate exact 3D geometric computation (poster). 5–8 March 2024. SIAM International Meshing Roundtable.
    [details]
    BibTeX
    @misc{imr24-gpu-geom-poster-2024,
        author = "Magalhães, Salles V. G. and Franklin, W. Randolph and Menezes, Marcelo",
        title = "Employing {GPU}s to accelerate exact {3D} geometric computation (poster)",
        note = "{SIAM} International Meshing Roundtable",
        year = "2024",
        month = "5--8 March",
        href = "\bibhreftp{246-imr24-gpu-geom-slide.pdf}{246-imr24-gpu-geom-poster.pdf}",
        mykey = "recent salles parallel topology marcelo homepage-selected"
    }
    

2022

  • Marcelo de Matos Menezes, Salles Viana Gomes Magalhães, Matheus Aguilar de Oliveira, W. Randolph Franklin, and Rodrigo Eduardo de Oliveira Bauer Chichorro. Fast parallel evaluation of exact geometric predicates on GPUs. J. Computer Aided Design, September 2022. Special Issue: 28th International Meshing Roundtable: Mesh Modeling for Simulations and Visualization. URL: https://www.sciencedirect.com/science/article/abs/pii/S0010448522000616, doi:https://doi.org/10.1016/j.cad.2022.103285.
    [details] [full text]
    Abstract
    This paper presents a technique for employing high-performance computing for accelerating the exact evaluation of geometric predicates. Arithmetic filters are implemented using interval arithmetic to reduce the necessity of exact arithmetic while ensuring the results of the predicates are still exact. Furthermore, the computation with interval arithmetic is offloaded to a CUDA-enabled GPU. If the GPU detects that some results cannot be trusted, the corresponding predicates are re-evaluated in parallel on the CPU using arbitrary-precision rational numbers. As a case study, a red-blue 3D triangle intersection algorithm has been implemented. Since the intervals are implemented using floating-point numbers, the parallel computing power of GPUs for processing these numbers led to a speedup of up to 1936 times (when compared against a similar sequential implementation) in the evaluation of these predicates (and up to 414 times if the entire runnning-time of the algorithm is considered). The excellent performance associated to the exactness makes this technique suitable for accelerating geometric operations in fields such as CAD, GIS and 3D modeling.
    BibTeX
    @article{marcelo-gpu-predicates-2021,
        author = "de Matos Menezes, Marcelo and Magalhães, Salles Viana Gomes and de Oliveira, Matheus Aguilar and Franklin, W. Randolph and de Oliveira Bauer Chichorro, Rodrigo Eduardo",
        editor = "Peiro, Joaquim and Shontz, Suzanne and Viertel, Ryan",
        title = "Fast parallel evaluation of exact geometric predicates on {GPU}s",
        month = "September",
        year = "2022",
        number = "103285",
        note = "Special Issue: 28th International Meshing Roundtable: Mesh Modeling for Simulations and Visualization",
        journal = "J. Computer Aided Design",
        doi = "https://doi.org/10.1016/j.cad.2022.103285",
        href = "\bibhref{239-marcelo-gpu-predicates-2021}",
        mykey = "recent salles marcelo matheus rodrigo parallel topology homepage-selected",
        url = "https://www.sciencedirect.com/science/article/abs/pii/S0010448522000616"
    }
    
  • Marcelo de Matos Menezes, Salles Viana Gomes de Magalhães, Matheus Aguilar, W. Randolph Franklin, and Bruno Coelho. Employing GPUs to accelerate exact geometric predicates for 3D geospatial processing. In John Krumm, Andreas Züfle, and Cyrus Shahabi, editors, Spatial Gems, volume 1, chapter 11. ACM, 2022. URL: https://www.spatialgems.net/.
    [details] [full text]
    Abstract
    This paper presents a technique to use GPUs to accelerate the computation of 3D geometric predicates. A common predicate is computing the orientation of four 3D points, which is a subproblem in applications such as intersecting two 3D meshes. Since the higher level application may require billions of evaluations, efficiency is important. Accuracy is required since floating roundoff errors can cause topological impossibilities. One solution is to compute with rational numbers, but that is difficult to implement on a GPU because rationals' sizes vary. Our solution is to compute on the GPU with interval arithmetic, but fall back to using rationals on the CPU if the interval computed on the GPU includes the origin; i.e., its sign is unknown. Our experiment with a dataset of hard rock mining drill holes show that this fallback to the CPU is rarely necessary; so that our technique gave a 17 times speedup compared to a sequential implementation.
    BibTeX
    @incollection{marcelo-employing-gem-2022,
        author = "de Matos Menezes, Marcelo and de Magalhães, Salles Viana Gomes and Aguilar, Matheus and Franklin, W. Randolph and Coelho, Bruno",
        editor = "Krumm, John and Züfle, Andreas and Shahabi, Cyrus",
        title = "Employing {GPU}s to accelerate exact geometric predicates for {3D} geospatial PROCESSING",
        booktitle = "Spatial Gems",
        publisher = "ACM",
        year = "2022",
        volume = "1",
        chapter = "11",
        mykey = "recent salles marcelo matheus bruno parallel topology",
        url = "https://www.spatialgems.net/",
        href = "\bibhref{242-marcelo-employing-gem-2022}"
    }
    
  • W. Randolph Franklin and Salles Viana Gomes de Magalhães. Minimal representations of polygons and polyhedra. In John Krumm, Andreas Züfle, and Cyrus Shahabi, editors, Spatial Gems, volume 1, chapter 5. ACM, 2022. URL: https://www.spatialgems.net/.
    [details] [full text]
    Abstract
    We present several simple representations of polygon and polyhedra that permit the efficient parallel computation of area and volume. They are particularly useful for computing the areas of the nonempty intersections between pairs of faces in two overlapping planar graphs in GIS, or the volumes of nonempty intersections between pairs of tetrahedra in two overlapping triangulations of a polyhedron in CAD. Both applications have been implemented on multicore Intel Xeons and tested on large datasets. The representations store the minimal types of information required for computation, and never need to store edge loops and face shells, or even most adjacency relations. The representations are sets of tuples or small fixed-size sets, and can be processed in parallel with map-reduce operations.
    BibTeX
    @incollection{minrep-gem-2022,
        author = "Franklin, W. Randolph and de Magalhães, Salles Viana Gomes",
        editor = "Krumm, John and Züfle, Andreas and Shahabi, Cyrus",
        title = "Minimal representations of polygons and polyhedra",
        booktitle = "Spatial Gems",
        publisher = "ACM",
        year = "2022",
        volume = "1",
        chapter = "5",
        mykey = "recent salles overlay topology",
        url = "https://www.spatialgems.net/",
        href = "\bibhref{241-minrep-gem-2022}"
    }
    

2021

  • W. Randolph Franklin, Salles Viana Gomes de Magalhães, and Eric N Landis. Fast 3-D Euclidean connected components. In John Krumm, editor, 3rd ACM SIGSPATIAL International Workshop on Spatial Gems (SpatialGems 2021). ACM, 2 Nov 2021. URL: https://www.spatialgems.net/.
    [details] [full text]
    Abstract
    We present an efficient algorithm, with implementations, for computing the connected components within a 3-D cube of voxels, also known as the Euclidean union-find problem. There may be over $10^9$ voxels. The components may be 8-connected or 26-connected. Computing connected components has applications ranging from material failure in concrete under increasing stress to electrical conductivity in complex metal objects to elasticity in 3D printed parts. On key to efficiency is representing voxels by 1-D \emphruns of adjacent voxels. As a special case, 2-D connected components of images may easily be computed.
    BibTeX
    @incollection{connect-gem-2021,
        author = "Franklin, W. Randolph and de Magalhães, Salles Viana Gomes and Landis, Eric N",
        editor = "Krumm, John",
        title = "Fast {3-D} {Euclidean} connected components",
        booktitle = "3rd {ACM SIGSPATIAL} International Workshop on Spatial Gems (SpatialGems 2021)",
        publisher = "ACM",
        year = "2021",
        month = "2 Nov",
        location = "Beijing, China (virtual)",
        mykey = "recent salles landis connect topology 2021",
        url = "https://www.spatialgems.net/",
        href = "\bibhref{240-connect-gem-2021}"
    }
    

2020

  • Marcelo de Matos Menezes, Salles Viana Gomes de Magalhães, Matheus Aguilar, W. Randolph Franklin, and Bruno Coelho. Employing GPUs to accelerate exact geometric predicates for 3D geospatial processing. In John Krumm, editor, 2nd ACM SIGSPATIAL International Workshop on Spatial Gems (SpatialGems 2020). ACM, Nov 2020. URL: https://www.spatialgems.net/.
    [details] [full text]
    Abstract
    This paper presents a technique to use GPUs to accelerate the computation of 3D geometric predicates. A common predicate is computing the orientation of four 3D points, which is a subproblem in applications such as intersecting two 3D meshes. Since the higher level application may require billions of evaluations, efficiency is important. Accuracy is required since floating roundoff errors can cause topological impossibilities. One solution is to compute with rational numbers, but that is difficult to implement on a GPU because rationals' sizes vary. Our solution is to compute on the GPU with interval arithmetic, but fall back to using rationals on the CPU if the interval computed on the GPU includes the origin; i.e., its sign is unknown. Our experiment with a dataset of hard rock mining drill holes show that this fallback to the CPU is rarely necessary; so that our technique gave a 17 times speedup compared to a sequential implementation.
    BibTeX
    @incollection{marcelo-employing-gem-2020,
        author = "de Matos Menezes, Marcelo and de Magalhães, Salles Viana Gomes and Aguilar, Matheus and Franklin, W. Randolph and Coelho, Bruno",
        editor = "Krumm, John",
        title = "Employing {GPU}s to accelerate exact geometric predicates for {3D} geospatial PROCESSING",
        booktitle = "2nd {ACM SIGSPATIAL} International Workshop on Spatial Gems (SpatialGems 2020)",
        publisher = "ACM",
        year = "2020",
        month = "Nov",
        mykey = "salles marcelo matheus bruno parallel topology",
        url = "https://www.spatialgems.net/",
        href = "\bibhref{238-marcelo-employing-gem-2020}",
        note = "Best paper award."
    }
    

2019

  • W. Randolph Franklin and Salles Viana Gomes de Magalhães. Minimal representations of polygons and polyhedra. In John Krumm, editor, 1st ACM SIGSPATIAL International Workshop on Spatial Gems (SpatialGems 2019). ACM, Nov 2019. URL: https://www.spatialgems.net/.
    [details] [full text]
    Abstract
    We present several simple representations of polygon and polyhedra that permit the efficient parallel computation of area and volume. They are particularly useful for computing the areas of the nonempty intersections between pairs of faces in two overlapping planar graphs in GIS, or the volumes of nonempty intersections between pairs of tetrahedra in two overlapping triangulations of a polyhedron in CAD. Both applications have been implemented on multicore Intel Xeons and tested on large datasets. The representations store the minimal types of information required for computation, and never need to store edge loops and face shells, or even most adjacency relations. The representations are sets of tuples or small fixed-size sets, and can be processed in parallel with map-reduce operations.
    BibTeX
    @incollection{minrep-gem-2019,
        author = "Franklin, W. Randolph and de Magalhães, Salles Viana Gomes",
        editor = "Krumm, John",
        title = "Minimal representations of polygons and polyhedra",
        booktitle = "1st {ACM SIGSPATIAL} International Workshop on Spatial Gems (SpatialGems 2019)",
        publisher = "ACM",
        year = "2019",
        month = "Nov",
        mykey = "recent salles overlay topology",
        url = "https://www.spatialgems.net/",
        href = "\bibhref{236-minrep-gem-2019}"
    }
    

2018

  • W. Randolph Franklin, Salles V. G. de Magalhães, and Marcus V. A. Andrade. Data structures for parallel spatial algorithms on large datasets (vision paper). In Proceedings of BigSpatial'18: 7th ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data. Seattle, USA, 6 Nov 2018.
    [details] [full text] [slides]
    Abstract
    This paper describes data structures and algorithms for efficient implementation of GIS operations for large datasets on multicore Intel CPUs and on NVIDA GPUs. Typical operations are boolean combinations of polygons and map overlay. Efficient parallelization prefers simple regular data structures, such as structures of arrays of plain old datatypes. Warps of 32 threads are required to execute the same instruction (or be idle). Ideally, the data used by adjacent threads is adjacent in memory. Minimizing storage is important, as is accessing it in a regular pattern. That disparages pointers, linked lists, and trees. That implies that explicitly representing global topology is bad. If using only local topological formulae is sufficient, then it will be much faster. E.g., for many operations on a 2-D map (aka planar graph), the set of oriented edges suffices. Each edge knows the locations of its endpoints and the ids of its adjacent polygons. Any mass operation, such as area computation or point location, can be implemented as a map-reduce. All these techniques also apply in 3D to CAD/CAM and additive manufacturing. Indeed they are more important there.
    BibTeX
    @inproceedings{par-ds-bigspatial-2018,
        author = "Franklin, W. Randolph and de Magalhães, Salles V. G. and Andrade, Marcus V. A.",
        title = "Data Structures for Parallel Spatial Algorithms on Large Datasets (Vision paper)",
        address = "Seattle, {USA}",
        month = "6 Nov",
        booktitle = "Proceedings of {BigSpatial'18}: 7th {ACM SIGSPATIAL} Workshop on Analytics for Big Geospatial Data",
        year = "2018",
        href = "\bibhrefpt{227-par-ds-bigspatial-2018}{227-par-ds-bigspatial-2018-talk.pdf}",
        customlinkslides = "https://wrfranklin.org/p/227-par-ds-bigspatial-2018-talk.pdf",
        mykey = "recent marcus salles topology parallel"
    }
    
  • W. Randolph Franklin, Salles V. G. de Magalhães, and Marcus V. A. Andrade. Exact fast parallel intersection of large 3-D triangular meshes (extended abstract). In 28th Annual Fall Workshop on Computational Geometry. Queens College, CUNY, New York City, 26–27 Oct 2018.
    [details] [full text]
    Abstract
    We present 3D-EPUG-Overlay, a fast, exact, parallel, memory-efficient, algorithm for computing the intersection between two large 3-D triangular meshes with geometric degeneracies. Applications include CAD/CAM, CFD, GIS, and additive manufacturing. 3D-EPUG-Overlay combines 5 separate techniques: multiple precision rational numbers to eliminate roundoff errors during the computations; Simulation of Simplicity to properly handle geometric degeneracies; simple data representations and only local topological information to simplify the correct processing of the data and make the algorithm more parallelizable; a uniform grid to efficiently index the data, and accelerate testing pairs of triangles for intersection or locating points in the mesh; and parallel programming to exploit current hardware. 3D-EPUG-Overlay is up to 101 times faster than LibiGL, and comparable to QuickCSG, a parallel inexact algorithm. 3D-EPUG-Overlay is also more memory efficient. In all test cases 3D-EPUG-Overlay's result matched the reference solution. It is freely available for nonprofit research and education at https://github.com/sallesviana/MeshIntersection . The full version of this paper is being presented at the 2018 International Meshing Roundtable; it is currently online at https://project.inria.fr/imr27/files/2018/09/1035.pdf.
    BibTeX
    @inproceedings{exact-fast-parallel-fwcg-2018,
        author = "Franklin, W. Randolph and de Magalhães, Salles V. G. and Andrade, Marcus V. A.",
        title = "Exact fast parallel intersection of large 3-{D} triangular meshes (extended abstract)",
        booktitle = "28th Annual Fall Workshop on Computational Geometry",
        address = "Queens College, {CUNY}, New York City",
        year = "2018",
        month = "26--27 Oct",
        href = "\bibhref{229-exact-fast-parallel-fwcg-2018}",
        mykey = "recent marcus salles overlay parallel topology"
    }
    

2016

  • W. Randolph Franklin and Salles Viana Gomes de Magalhães. Local topology and parallel overlaying large planar graphs. 15 Feb 2016. Talk at Georgia Tech, School of Interactive Computing. Also given at IBM Haifa, Microsoft Haifa, Ben Gurion U, and Tel Aviv U in Dec 2015.
    [details] [slides]
    BibTeX
    @misc{local-talk-gatech-2016,
        author = "Franklin, W. Randolph and de Magalhães, Salles Viana Gomes",
        title = "Local topology and parallel overlaying large planar graphs",
        note = "Talk at Georgia Tech, School of Interactive Computing. Also given at IBM Haifa, Microsoft Haifa, Ben Gurion U, and Tel Aviv U in Dec 2015",
        month = "15 Feb",
        year = "2016",
        href = "\bibhreft{208-local-talk-gatech-2016.pdf}",
        customlinkslides = "https://wrfranklin.org/p/208-local-talk-gatech-2016.pdf",
        mykey = "salles overlay topology parallel"
    }
    

2015

  • W. Randolph Franklin and Salles Viana Gomes de Magalhães. Global properties from local topology. 10 Nov 2015. Talk at UC Santa Barbara, Center for Spatial Studies.
    [details] [slides]
    BibTeX
    @misc{local-talk-ucsb-2015,
        author = "Franklin, W. Randolph and de Magalhães, Salles Viana Gomes",
        title = "Global properties from local topology",
        note = "Talk at {UC Santa Barbara}, Center for Spatial Studies",
        month = "10 Nov",
        year = "2015",
        mykey = "salles topology",
        href = "\bibhreft{207-local-talk-ucsb-2015.pdf}",
        customlinkslides = "https://wrfranklin.org/p/207-local-talk-ucsb-2015.pdf"
    }
    

2013

  • W. Randolph Franklin. Parallel volume computation of massive polyhedron union. In 23rd Fall Workshop on Computational Geometry. City College, New York City, USA, 25–26 Oct 2013. (extended abstract).
    [details] [full text] [slides]
    Abstract
    We present a parallel implementation of UNION3, an algorithm for computing the volume, surface area, center of mass, or similar properties of a boolean combination of many polyhedra. UNION3 has been implemented on the special case of the union of congruent isothetic cubes, and tested on 100, 000, 000 cubes. The algorithm uses a volume formula that does not require first computing the explicit union. All that is needed is the set of output vertices, including each vertex's position and neighborhood. UNION3's computation does not use randomization or sampling, and its output is exact. The implementation is parallel, using OpenMP. When using 32 threads, UNION3's elapsed time is only a few minutes, and the speedup, compared to using one thread, is a factor of ten. When executed on uniform random i.i.d input, UNION3's execution time is linear in the number of output vertices. UNION3 is intended as an example of a parallel geometry algorithm whose techniques should be broadly applicable.
    BibTeX
    @inproceedings{fwcg-2013,
        author = "Franklin, W. Randolph",
        title = "Parallel Volume Computation of Massive Polyhedron Union",
        booktitle = "23rd Fall Workshop on Computational Geometry",
        year = "2013",
        month = "25--26 Oct",
        address = "City College, New York City, USA",
        note = "(extended abstract)",
        href = "\bibhrefpt{171-fwcg2013-parallel-union}{171-fwcg2013-parallel-union-talk.pdf}",
        customlinkslides = "https://wrfranklin.org/p/171-fwcg2013-parallel-union-talk.pdf",
        mykey = "union3 topology parallel"
    }
    

2005

  • Wm. Randolph Franklin. Mass properties of the union of millions of identical cubes. In Ravi Janardan, Debashish Dutta, and Michiel Smid, editors, Geometric and Algorithmic Aspects of Computer Aided Design and Manufacturing, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 67, pages 329–345. American Mathematical Society, 2005.
    [details] [full text] [slides]
    BibTeX
    @incollection{wrf-dimacs2005,
        author = "Franklin, Wm. Randolph",
        editor = "Janardan, Ravi and Dutta, Debashish and Smid, Michiel",
        title = "Mass Properties of the Union of Millions of Identical Cubes",
        booktitle = "Geometric and Algorithmic Aspects of Computer Aided Design and Manufacturing, {DIMACS} Series in Discrete Mathematics and Theoretical Computer Science",
        publisher = "American Mathematical Society",
        volume = "67",
        year = "2005",
        pages = "329--345",
        mykey = "union3 topology",
        succeeds = "wrf-dimacs2003",
        customlinkslides = "https://wrfranklin.org/p/104-dimacs03-union-talk.pdf",
        href = "\bibhrefpt{104-dimacs03-union}{104-dimacs03-union-talk.pdf}"
    }
    

2004

  • W. Randolph Franklin. Analysis of mass properties of the union of millions of polyhedra. In M. L. Lucian and M. Neamtu, editors, Geometric Modeling and Computing: Seattle 2003, pages 189–202. Nashboro Press, Brentwood TN, 2004.
    [details] [full text]
    BibTeX
    @incollection{wrf-union-analysis-2004,
        author = "Franklin, W. Randolph",
        editor = "Lucian, M. L. and Neamtu, M.",
        title = "Analysis of Mass Properties of the Union of Millions of Polyhedra",
        year = "2004",
        booktitle = "Geometric Modeling and Computing: Seattle 2003",
        publisher = "Nashboro Press, Brentwood TN",
        pages = "189--202",
        isbn = "0-0-9728482-3-1",
        mykey = "union3 topology parallel",
        href = "\bibhref{101-siam04-union}"
    }
    

1995

  • Mohan Kankanhalli and Wm Randolph Franklin. Area and perimeter computation of the union of a set of iso-rectangles in parallel. J. Parallel Distrib. Comput., 27(2):107–117, June 1995. doi:https://doi.org/10.1006/jpdc.1995.1076.
    [details] [full text]
    Abstract
    Finding the area and perimeter of the union/intersection of a set of iso-rectangles is a very important part of circuit extraction in VLSI design. We combine two techniques, the uniform grid and the vertex neighborhoods, to develop a new parallel algorithm for the area and perimeter problems which has an average linear time performance but is not worst-case optimal. The uniform grid technique has been used to generate the candidate vertices of the union or intersection of the rectangles. An efficient point-in-rectangles inclusion test filters the candidate set to obtain the relevant vertices of the union or intersection. Finally, the vertex neighborhood technique is used to compute the mass properties from these vertices. This algorithm has an average time complexity of O(((n + k)/p) + log p) where n is the number of input rectangle edges with k intersections on p processors assuming a PRAM model of computation. The analysis of the algorithm on a SIMD architecture is also presented. This algorithm requires very simple data structures which makes the implementation easy. We have implemented the algorithm on a Sun 4/280 workstation and a Connection Machine. The sequential implementation performs better than the optimal algorithm for large datasets. The parallel implementation on a Connection Machine CM-2 with 32K processors also shows good results.
    BibTeX
    @article{kf-apcus-92,
        author = "Kankanhalli, Mohan and Franklin, Wm Randolph",
        title = "Area and Perimeter Computation of the Union of a Set of Iso-Rectangles in Parallel",
        year = "1995",
        pages = "107--117",
        volume = "27",
        number = "2",
        doi = "https://doi.org/10.1006/jpdc.1995.1076",
        month = "June",
        journal = "J. Parallel Distrib. Comput.",
        keywords = "intersection, parallel computation, grids, area",
        href = "\bibhref{85-jpdc95-parallel-union-area}",
        mykey = "topology kankanhalli parallel"
    }
    

1992

  • WR Franklin. Local topological properties of polyhedra. (unpublished talk), Sept 1992. URL: https://wrfranklin.org/wiki/Research/unpub/localtopo.pdf.
    [details]
    Abstract
    What various data structures are possible to represent polygons and polyhedra? Having only local information about the location and neighborhood of each vertex is sufficient, and surprisingly useful.
    BibTeX
    @unpublished{wrf-localtopo-92,
        author = "Franklin, WR",
        title = "Local topological properties of polyhedra",
        month = "Sept",
        year = "1992",
        note = "(unpublished talk)",
        mykey = "topology",
        url = "https://wrfranklin.org/wiki/Research/unpub/localtopo.pdf"
    }
    

1990

  • Wm Randolph Franklin, Narayanaswami Chandrasekhar, Mohan Kankanhalli, Varol Akman, and Peter YF Wu. Efficient geometric operations for CAD. In Michael J. Wozny, Joshua U. Turner, and K. Preiss, editors, Geometric Modeling for Product Engineering, pages 485–498. Elsevier Science Publishers B.V. (North-Holland), 1990.
    [details] [full text]
    BibTeX
    @incollection{fckaw-egoc-90,
        author = "Franklin, Wm Randolph and Chandrasekhar, Narayanaswami and Kankanhalli, Mohan and Akman, Varol and Wu, Peter YF",
        editor = "Wozny, Michael J. and Turner, Joshua U. and Preiss, K.",
        title = "Efficient Geometric Operations for {CAD}",
        booktitle = "Geometric Modeling for Product Engineering",
        publisher = "Elsevier Science Publishers B.V. (North-Holland)",
        year = "1990",
        note = "Selected and expanded papers from the IFIP WG 5.2/NSF Working Conference on Geometric Modeling, Rensselaerville, USA, 18-22 September 1988",
        pages = "485--498",
        href = "\bibhref{58-wozny90-efficient}",
        mykey = "topology chandra akman kankanhalli",
        keywords = "intersection, CAD, grids"
    }
    

1987

  • Wm Randolph Franklin. Polygon properties calculated from the vertex neighborhoods. In Proc. 3rd Annu. ACM Sympos. Comput. Geom., 110–118. 1987.
    [details] [full text]
    BibTeX
    @inproceedings{f-ppcvn-87,
        author = "Franklin, Wm Randolph",
        title = "Polygon properties calculated from the vertex neighborhoods",
        booktitle = "Proc. 3rd Annu. ACM Sympos. Comput. Geom.",
        year = "1987",
        pages = "110--118",
        oldlabel = "geom-1214",
        href = "\bibhref{46-scg87-vertex}",
        mykey = "topology",
        keywords = "rays, measure, polygons"
    }
    

1982

  • Wm Randolph Franklin. Efficient polyhedron intersection and union. In Proc. Graphics Interface, 73–80. Toronto, 1982.
    [details] [full text]
    BibTeX
    @inproceedings{f-epiu-82,
        author = "Franklin, Wm Randolph",
        title = "Efficient polyhedron intersection and union",
        booktitle = "Proc. Graphics Interface",
        pages = "73-80",
        address = "Toronto",
        year = "1982",
        href = "\bibhref{15-gi82-xsect}",
        mykey = "topology",
        keywords = "intersection, CAD"
    }
    

Contact: WRF

Explore all pages →Back to top ↑