A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Orientation, simplicity, and inclusion test for planar polygons
1995
Computers & graphics
Preserved Fulltext
Acknowledgements-We want to express our thanks to referees for his comments and suggestions. RFaFERENCES ...
CONCLUSION This paper has presented a collection of robust and simple algorithms to calculate the orientation, simplicity and inclusion for planar polygons, without solving any equation systems and without ...
Ahatract-This paper presents a collection of robust and simple algorithms to decide the orientation, simplicity, and inclusion of planar polygons, without solving any equation systems and without using ...
doi:10.1016/0097-8493(95)00037-d
fatcat:7qcclofw5bfo3kkkayikvwtta4
A new algorithm for Boolean operations on general polygons
2005
Computers & graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements The authors wish to thank the anonymous reviewers for many helpful comments and suggestions. Thanks are also due to Mr. Zi-Heng Peng for carefully proofreading this paper. ...
The Rivero and Feito algorithm has to calculate the levels of all simplices of the two polygons. ...
Then, the simplices, whose corresponding numbers appear at the last column (for simplices of P Ã 2 ) and at the last row (for simplices of P Ã 1 ) are 1, respectively, are selected to build the resultant ...
doi:10.1016/j.cag.2004.11.001
fatcat:ull5w6jkubffnmiwtt3k57ve2i
Validation and Automatic Repair of Planar Partitions Using a Constrained Triangulation
2012
Photogrammetrie - Fernerkundung - Geoinformation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It uses a constrained triangulation of the polygons as a base-which by definition is a planar partition-and only simple operations are needed (i.e. labelling of triangles) to both validate and repair. ...
Existing approaches to validate planar partitions involve first building a planar graph of the polygons and enforcing constraints, then repair is done by snapping vertices and edges of this graph. ...
In our previous work on validation [Ledoux and Meijers, 2010] , we used the centroid of a polygon to start the labelling process, but this method is prone to errors (if for instance the calculated centroid ...
doi:10.1127/1432-8364/2012/0143
fatcat:u6njslcsmrcwpgag2ukzail7ny
coxeter: A Python package for working with shapes
2021
Journal of Open Source Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The package emphasizes simplicity and flexibility, using a common set of abstractions to present a largely uniform interface across various shapes and allowing easy mutation of almost all of their geometric ...
Figure 1 : The coxeter package supports calculating a wide range of properties on shapes in two and three dimensions. ...
Eric Irrgang for prototype implementations of various parts of this code, as well as Bryan VanSaders and James Proctor for collecting the various early prototypes and relevant methods into a single code ...
doi:10.21105/joss.03098
fatcat:32o7odytjjdalgnfoux3tg55ay
Robust Polygons Clipping to Model Complex Objects
[article]
2000
Eurographics State of the Art Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
One of the most important problems to solve in Solids Modelling is computing the boolean operations for solids (union, intersection and difference). ...
A very interesting application of this algorithm is the modelling of complex solids with this type of polygons as faces. ...
Acknowledgements The authors wish to thank to the anonymous reviewers for their constructive comments which led to several improvements in the presentation of this paper. ...
doi:10.2312/egs.20001002
fatcat:j7kqxtic3jfjrjss3pd7fca66u
Topological-based roof modeling from 3D point clouds
2020
Journal of WSCG
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
This topological approach makes our solution more simple and robust than existing methods which mostly extract the intersection lines by means of geometrical computations. ...
Roof planes are initially delineated by a segmentation algorithm combining a robust Hough-based normal estimator and a region growing strategy. ...
A comparison between these methods is presented in [45] for automatic segmentation of planar areas from point clouds. Region growing gains its place thanks to its simplicity and efficiency. ...
doi:10.24132/jwscg.2020.28.17
fatcat:7pjagrzwsjachbexo6eothlxtm
An algorithm for determining intersection segment-polygon in 3D
1998
Computers & graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this work we present a new algorithm for testing the intersection between a segment and a polygon in 3D space. ...
This algorithm is robust and ecient, and it is the basis of most operations developed in geometric modelling. ...
AcknowledgementsÐWe are grateful for the suggestions by Dr Juan C. Torres, and the comments of the anonymous reviewers. ...
doi:10.1016/s0097-8493(98)00064-8
fatcat:44xi7wotnfg6delmeh6mpkjt5u
Robust structural identification via polyhedral template matching
2016
Modelling and Simulation in Materials Science and Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In addition, the method makes it easy to identify the local lattice orientation in polycrystalline samples, and to calculate the local strain tensor. ...
Successful scientific applications of large-scale molecular dynamics often rely on automated methods for identifying the local crystalline structure of condensed phases. ...
A. Lazar for fruitful discussions of the manuscript. We gratefully acknowledge funding from The Danish National Research Foundation's Center ...
doi:10.1088/0965-0393/24/5/055007
fatcat:iszldjbmf5gjtlj2umdmadijti
Ellipse Detection and Matching with Uncertainty
[chapter]
1991
BMVC91
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
A central theme of the work is the explicit use of uncertainty, which reflects observation errors in the image data, and which is propagated through the model matching stages, providing a consistent and ...
robust representation of errors. ...
The iterative Kalman filter is initialised (XQ, SO) with values calculated from the LMS method. ...
doi:10.1007/978-1-4471-1921-0_18
fatcat:eibbfuu7xbadbe6ljtmy4r3laq
Ellipse Detection and Matching with Uncertainty
1991
Procedings of the British Machine Vision Conference 1991
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
A central theme of the work is the explicit use of uncertainty, which reflects observation errors in the image data, and which is propagated through the model matching stages, providing a consistent and ...
robust representation of errors. ...
The iterative Kalman filter is initialised (XQ, SO) with values calculated from the LMS method. ...
doi:10.5244/c.5.18
dblp:conf/bmvc/EllisAB91
fatcat:26hn2pnsarco3jh4yxiraansbq
Ellipse detection and matching with uncertainty
1992
Image and Vision Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
A central theme of the work is the explicit use of uncertainty, which reflects observation errors in the image data, and which is propagated through the model matching stages, providing a consistent and ...
robust representation of errors. ...
The iterative Kalman filter is initialised (XQ, SO) with values calculated from the LMS method. ...
doi:10.1016/0262-8856(92)90041-z
fatcat:rkwnmzhbbvbfffkmarlsdyjwga
Robust and Adaptive Surface Reconstruction using Partition of Unity Implicits
2007
Computer Graphics and Image Processing (SIBGRAPI), Proceedings of the Brazilian Symposium on
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our method relies on the J A 1 triangulation to perform both the spatial subdivision and the isosurface extraction. ...
Finally, we compare our results with previous work to demonstrate the robustness of our method. ...
Acknowledgments This work was partially supported by DAAD, with grant number A/04/08711, by FAPESP, with grant numbers 04/10947-6, 06/54477-9 and 05/57735-6 and by Capes/DAAD, with grant number 262/07. ...
doi:10.1109/sibgra.2007.4368173
fatcat:xdb34u3y5jgjdioxehwrvfxiua
Robust and Adaptive Surface Reconstruction using Partition of Unity Implicits
2007
XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our method relies on the J A 1 triangulation to perform both the spatial subdivision and the isosurface extraction. ...
Finally, we compare our results with previous work to demonstrate the robustness of our method. ...
Acknowledgments This work was partially supported by DAAD, with grant number A/04/08711, by FAPESP, with grant numbers 04/10947-6, 06/54477-9 and 05/57735-6 and by Capes/DAAD, with grant number 262/07. ...
doi:10.1109/sibgrapi.2007.8
dblp:conf/sibgrapi/GoisPETCEN07
fatcat:6fbzhpji35dazh7bwf6jgktivy
Page 5117 of Mathematical Reviews Vol. , Issue 92i
[page]
1992
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Bini (1-PISA)
92i:65230 65Y25
Balbes, R. (1-MOSL); Siegel, J. (1-MOSL)
A robust method for calculating the simplicity and orientation of planar polygons.
Comput. Aided Geom. ...
This paper presents algorithms which utilize winding numbers to avoid most of the difficulties associated with this problem and, for simple polygons, also to calculate their orientation.”
68 COMPUTER SCIENCE ...
On the Validation of Solids Represented with the International Standards for Geographic Information
2013
Computer-Aided Civil and Infrastructure Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
I would like to thank Junqiao Zhao, Ken Arroyo Ohori, Kevin Wiebe, Brittany Zenger and Jan Kooijman for helping out with the implementation and for very useful discussions. ...
., the Dutch Technology Foundation STW (project code: 11300), and by the "3D Pilot" in the Netherlands (thank you Jantien Stoter for giving validation an important role). ...
Enforcing simplicity requires calculating the intersections between the surfaces. ...
doi:10.1111/mice.12043
fatcat:j65vztnnvnhzxd6hnbpbac5bfi
« Previous
Showing results 1 — 15 out of 2,598 results