This HTML5 document contains 82 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n21https://xlinux.nist.gov/dads/HTML/
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n11http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n25http://www.research.ibm.com/journal/sj/041/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n18http://www.phatcode.net/res/224/files/html/ch35/
n27http://www.pdp8online.com/563/
freebasehttp://rdf.freebase.com/ns/
n13https://archive.org/details/michaelabrashsgr00abra/page/
n24http://rosettacode.org/wiki/Bitmap/
n6http://commons.wikimedia.org/wiki/Special:FilePath/
n15http://www.cs.helsinki.fi/group/goa/mallinnus/lines/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n14http://homepages.enterprise.net/murphy/thickline/
n26http://members.chello.at/~easyfilter/
owlhttp://www.w3.org/2002/07/owl#
n17http://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
n23https://web.archive.org/web/20080528040104/http:/www.research.ibm.com/journal/sj/041/
n20https://sites.google.com/site/patrickmaillot/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Bresenham's_line_algorithm
rdf:type
dbo:Software
rdfs:label
Bresenham's line algorithm
rdfs:comment
Bresenham's line algorithm is a line drawing algorithm that determines the points of an n-dimensional raster that should be selected in order to form a close approximation to a straight line between two points. It is commonly used to draw line primitives in a bitmap image (e.g. on a computer screen), as it uses only integer addition, subtraction and bit shifting, all of which are very cheap operations in commonly used computer instruction sets such as x86_64. It is an incremental error algorithm. It is one of the earliest algorithms developed in the field of computer graphics. An extension to the original algorithm may be used for drawing circles.
owl:sameAs
yago-res:Bresenham's_line_algorithm freebase:m.0h4m6
dbp:wikiPageUsesTemplate
dbt:Cite_journal dbt:Cite_news dbt:Short_description dbt:ISBN dbt:Commons_category dbt:Reflist dbt:Cite_book
dct:subject
dbc:Digital_geometry dbc:Computer_graphics_algorithms dbc:Articles_with_example_pseudocode
dbo:wikiPageExternalLink
n13:654 n14:index.html n13:654%7Curl-access=registration n15:bresenh.html n18:35-01.html n20:english n21:bresenham.html n23:ibmsjIVRIC.pdf n24:Bresenham's_line_algorithm n25:ibmsjIVRIC.pdf%7Carchive-date=May n26:bresenham.html n26:Bresenham.pdf%7Cyear=2012 n27:563.shtml
dbo:thumbnail
n6:Bresenham.svg?width=300
foaf:depiction
n6:Bresenham.svg n6:Line_1.5x+1_--_points.svg n6:Line_1.5x+1_--_planes.svg n6:Line_1.5x+1_--_candidates.svg n6:Line_1.5x+1.svg
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
n17:Bresenham's_line_algorithm?oldid=1073834153&ns=0
dbo:wikiPageID
64005
dbo:wikiPageLength
21821
dbo:wikiPageRevisionID
1073834153
dbo:wikiPageWikiLink
dbr:UV_mapping dbc:Computer_graphics_algorithms dbr:Voxel dbr:Digital_differential_analyzer_(graphics_algorithm) n11:Line_1.5x+1.svg dbr:Xiaolin_Wu's_line_algorithm dbr:Bitwise_operation n11:Line_1.5x+1_--_candidates.svg n11:Line_1.5x+1_--_planes.svg dbc:Digital_geometry n11:Line_1.5x+1_--_points.svg dbr:Circular_sector dbr:Firmware dbr:Raster_graphics dbr:Circle dbr:X86-64 dbr:Plotter dbr:Glossary_of_computer_graphics dbr:Spatial_anti-aliasing dbc:Articles_with_example_pseudocode dbr:Slope dbr:Association_for_Computing_Machinery dbr:Midpoint_circle_algorithm dbr:IBM_1401 dbr:Bitmap dbr:Graphics_card n11:Bresenham.svg dbr:Line_segment dbr:Computer_graphics dbr:Pixel dbr:Instruction_set_architecture dbr:IBM dbr:Graphics_library dbr:Jack_Elton_Bresenham dbr:Calcomp_plotter dbr:Graphics_processing_unit dbr:Geometric_primitive dbr:Graphics_hardware dbr:Software dbr:Computer_monitor dbr:Line_drawing_algorithm
dbo:abstract
Bresenham's line algorithm is a line drawing algorithm that determines the points of an n-dimensional raster that should be selected in order to form a close approximation to a straight line between two points. It is commonly used to draw line primitives in a bitmap image (e.g. on a computer screen), as it uses only integer addition, subtraction and bit shifting, all of which are very cheap operations in commonly used computer instruction sets such as x86_64. It is an incremental error algorithm. It is one of the earliest algorithms developed in the field of computer graphics. An extension to the original algorithm may be used for drawing circles. While algorithms such as Wu's algorithm are also frequently used in modern computer graphics because they can support antialiasing, the speed and simplicity of Bresenham's line algorithm means that it is still important. The algorithm is used in hardware such as plotters and in the graphics chips of modern graphics cards. It can also be found in many software graphics libraries. Because the algorithm is very simple, it is often implemented in either the firmware or the graphics hardware of modern graphics cards. The label "Bresenham" is used today for a family of algorithms extending or modifying Bresenham's original algorithm.
foaf:isPrimaryTopicOf
n17:Bresenham's_line_algorithm